Author:
Allender Eric,Balcázar Jose,Immerman Neil
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Manindra Agrawal and Somenath Biswas, “Polynomial Isomorphism of 1-L-Complete Sets,” manuscript, 1992.
2. Eric Allender, “Isomorphisms and 1-L Reductions,” J. Computer Sys. Sci. 36 (1988), 336–350.
3. Eric Allender, “P-Uniform Circuit Complexity,” JACM 36 (1989), 912–928.
4. Eric Allender and Vivek Gore, “A Uniform Circuit Lower Bound for the Permanent,” DIMACS Tech Report 92-30. A preliminary version appeared as “On Strong Separations from AC0,” Proc. FCT '91, Lecture Notes in Computer Science 529, Springer-Verlag, 1991, 1–15.
5. D. Barrington, N. Immerman, H. Straubing, “On Uniformity Within NC1,” J. Computer Sys. Sci. 41 (1990), 274–306.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The First-Order Isomorphism Theorem;FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science;2001
2. A Perspective on Lindström Quantifiers and Oracles;Lecture Notes in Computer Science;1999
3. Complete Sets and Structure in Subrecursive Classes;Logic Colloquium’ 96;1998
4. Counting Quantifiers, Successor Relations, and Logarithmic Space;Journal of Computer and System Sciences;1997-06