A note on the circuit complexity of PP

Theoretical Computer Science

Volumn 347, Issue 1-2, 2005, Pages 415-418

  Vinodchandran, N V ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Circuit lower bounds; Complexity classes; Computational complexity

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY;

BOOLEAN CIRCUITS; CIRCUIT COMPLEXITY; COMPLEXITY CLASSES;

COMPUTER SCIENCE;

EID: 27844554383     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.032     Document Type: Article

References (16)

1. S. Aaronson, Oracles are subtle but not malicious, Technical Report TR05-040, Electronic Colloq. on Computational Complexity, 2005, available at 〈http://www.eccc.uni-trier.de/eccc/〉.
2. V. Arvind, J. Köbler, U. Schöning, and R. Schuler If NP has polynomial-size circuits then MA = AM Theoret. Comput. Sci. 137 2 1995 279 282
3. L. Babai, Trading group theory for randomness, in: Proc. of the 17th ACM Symp. on Theory of Computing, 1985, pp. 421-429.
4. L. Babai, and L. Fortnow Arithmetization: a new method in structural complexity theory Comput. Complexity 1 1991 41 66
5. J. Balcázar, J. Díaz, and J. Gabarró Structural Complexity - I & II 1988 Springer Berlin
6. R. Beigel Perceptrons, PP, and the polynomial hierarchy Comput. Complexity 4 4 1994 339 349
7. NP, in: Proc. of the 42nd Annu. IEEE Symp. on Foundations of Computer Science, 2001, pp. 620-629.
8. J. Gill Computational complexity of probabilistic complexity classes SIAM J. Comput. 6 1977 675 695
9. R. Kannan Circuit-size lower bounds and non-reducibility to sparse sets Inform. Control 55 1982 40 56
10. R. Karp, R. Lipton, Some connections between uniform and non-uniform complexity classes, in: Proc. of the 12th Ann. ACM Symp. on Theory of Computing, 1980, pp. 302-309.
11. C. Lund, L. Fortnow, H. Karloff, and N. Nisan Algebraic methods for interactive proof systems J. ACM 39 4 1992 859 868
12. C. Papadimitriou Computational Complexity 1994 Addison-Wesley Reading, MA
13. U. Schöning Probabilistic complexity classes and lowness J. Comput. System Sci. 39 1988 84 100
14. S. Toda, and M. Ogiwara Counting classes are at least as hard as the polynomial-time hierarchy SIAM J. Comput. 21 2 1992 316 328
15. N.K. Vereshchagin On the power of PP Proc. of the 7th IEEE Annu. Conf. on Structure in Complexity Theory 1992 Boston MA, USA 138 143
16. C.B. Wilson Reltivized circuit complexity J. Comput. System Sci. 31 2 1985 169 181