Author:
Allender Eric,Reinhardt Klaus,Zhou Shiyu
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference40 articles.
1. E. Allender, R. Beals, and, M. Ogihara, The complexity of matrix rank and feasible systems of linear equations, Comput. Complexity, to appear. [A preliminary version appeared in STOC 96, 1996]
2. A very hard log-space counting class;Àlvarez;Theoret. Comput. Sci.,1993
3. Making computation count: Arithmetic circuits in the nineties;Allender;SIGACT NEWS,1997
4. Relationships among PL, #L, and the determinant;Allender;RAIRO-Theoret. Inform. Appl.,1996
5. P-printable sets;Allender;SIAM J. Comput.,1988
Cited by
51 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献