Circuits over PP and PL

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1997, Pages 24-35

  Beigel, R ^a   Fu, Bin ^a,b  

^a Yale University   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; TIMING CIRCUITS;

BOOLEAN FORMULAE; TRUTH TABLES;

BOOLEAN ALGEBRA;

EID: 0040655312     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1997.612297     Document Type: Conference Paper

References (19)

1. E. Allender and M. Ogihara. Relationships among PL, #P, and the determinant. In Proceedings of the 9th Annual Conference on Structure in Complexity Theory, pages 267-278, 1994.
2. J. Aspnes, R. Beigel, M. Furst, and S. Rudich. The expressive power of voting polynomials. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 402-409, 1991.
3. R. Beigel. Perceptrons, PP, and the polynomial hierarchy. In Proceedings of the 7th Annual Conference on Structure in Complexity Theory, pages 14-19, 1992.
4. R. Beigel. When do extra majority gates help? polylog (n) majority gates are equivalent to one. Comp. Complexity, 4: 314-324, 1994. Special issue devoted to the 4th Annual McGill Workshop on Complexity Theory.
5. R. Beigel, L. A. Hemachandra, and G. Wechsung. On the power of probabilistic polynomial time: P [' O g l C PP. In Proceedings of the 4th Annual Conference on Structure in Complexity Theory, pages 225-227, June 1989. A revised version appears in Information Processing Letters.
6. R. Beigel, N. Reingold, and D. Spielman. PP is closed under intersection. JCSS, 50 (2): 191-202, 1995.
7. A. Borodin, S. Cook, and N. Pippenger. Parallel computation for well-endowed rings and space bounded probabilistic machines. Informationand Computation, 58: 113-136, 1983.
8. S. Fenner, L. Fortnow, and S. Kurtz. Gapdefinable counting classes. In Proceedings of the 6th Annual Conference on Structure in Complexity Theory, pages 30-42. IEEE Computer Society Press, 199 1.
9. L. Fortnow and N. Reingold. PP is closed under truth-table reductions. I f: & Comp., 124 (1): 1-6, Jan. 1996.
10. J. Gill. Computational complexity of probabilistic Turing machines. SICOMP, 6: 675-695, 1977.
11. G. Gottlob. NP trees and Carnap's modal logic. In Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993.
12. H. Jung. On probablistic time and space. In LNCSl94, pages 3 10-3 17. Springer-Verlag, 1985.
13. M. Ogihara.=ACF. In Proceedings of the 11 th Annual Symposium on Theoretical Aspects of Computer Science, 1994.
14. M. Ogihara. The PL hierarchy collapses. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996.
15. D. A. Russo. Structural Properties of Complexity Classes. PhD thesis, University of Califomia at Santa Barbara, Mar. 1985.
16. W. Ruzzo, J. Simon, and M. Tompa. Spacebounded hierarchies and probabilistic computations. JCSS, 28: 216-230, 1982.
17. J. Simon. On Some Central Problems In Computational Complexity. PhD thesis, Come11 University, Ithaca, New York, 1975. Dept. of Computer Science, TR 75-224.
18. S. Toda. PP is as hard as the polynomial-time hierarchy. SICOMP, 20 (5): 865-877, 1991.
19. C. B. Wilson. Relativized circuit complexity. JCSS, 31 (2): 169-181, Oct. 1985