A note on uniform circuit lower bounds for the counting hierarchy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1090, Issue , 1996, Pages 127-135

  Allender, Eric ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

LEAF LANGUAGES; LOWER BOUNDS; UNIFORM CIRCUITS;

TIMING CIRCUITS;

EID: 84948968276     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61332-3_145     Document Type: Conference Paper

References (17)

1. [ABHH] E. Allender, Richard Beigel, Ulrich Hertrampf, and Steven Homer, Almost-everywhere complexity hierarchies for nondeterministic time, Theoretical Computer Science 115 (1993) 225-242.
2. [AG94] E. Allender and Vivek Gore, A uniform circuit lower bound for the permanent, SIAM Journal on Computing 23 (1994) 1026-1049.
3. 1, J. Comput. and System Sci. 38, 150-164.
4. l, Journal of Computer and System Sciences 41, 274-306.
5. 1, J. Assoc. Comput. Mach., 35 (1988), pp. 941-952.
6. [BG70] R. Book and S. Greibach, Quasi-realtime languaqes, Mathematical Systems Theory 4 (1970) 97-111.
7. 1 computation, to appear in Proc. 11th Annual IEEE Conference on Computational Complexity, 1996.
8. [FSS84] M. Furst, J. Saxe, and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Mathematical Systems Theory 17 (1984) 13-27.
9. [Hå87] J. Hâstad, Computational Limitations for Small Depth Circuits, MIT Press, Cambridge, MA, 1987.
10. [PS88] I. Parberry and G. Schnitger, Parallel computation with threshold functions, J. Computer and System Science 36, 278-302.
11. [Ra87] A. A. Razborov, Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Mathematicheskie Zametki 41(4), 598-607. English translation in Mathematical Notes of the Academy of Sciences of the USSR 41: 4, 333-338.
12. [RR94] A. Razborov and S. Rudich, Natural proofs, in Proc. 26th Annual Symposium on Theory of Computing, 1994, pp. 204-213.
13. [SFM78] J. Seiferas, M. Fischer, and A. Meyer, Separating nondeterministic time complexity classes, J. ACM 25 (1978) 146-167.
14. [Sm87] R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proc. 19th ACM Symposium on Theory of Computing, pp. 77-82.
15. [Wa86] K. W. Wagner, The complexity of combinatorial problems with succinct input representation, Acta Informatica 23, 325-356.
16. [Ya85] A. C. Yao, Separating the polynomial-time hierarchy by oracles, Proc. 26th IEEE Symposium on Foundations of Computer Science, pp. 1-10.
17. [Z83] S. Zák, A Turing machine hierarchy, Theoretical Computer Science 26 (1983) 327-333.