Author:
Pavan A.,Tewari Raghunath,Vinodchandran N. V.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference27 articles.
1. E. Allender & M. Ogihara (1994). Relationships among PL, #L, and the determinant. In Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth Annual, 267–278.
2. Eric Allender (1986). The complexity of sparse sets in P. In Proc. of the conference on Structure in complexity theory, 1–11. ISBN 0-387-16486-3.
3. Eric Allender (2006) NL-printable sets and nondeterministic Kolmogorov complexity. Theor. Comput. Sci. 355(2): 127–138
4. Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy (2009) Planar and Grid Graph Reachability Problems. Theory Comput. Syst. 45(4): 675–723
5. Eric Allender, Robert Beals & Mitsunori Ogihara (1999a). The complexity of matrix rank and feasible systems of linear equations. Comput. Complex. 8, 99–126. ISSN 1016-3328. http://portal.acm.org/citation.cfm?id=329550.329552 .
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献