Relating polynomial time to constant depth

Theoretical Computer Science

Volumn 207, Issue 1, 1998, Pages 159-170

  Vollmer, Heribert ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Boolean circuits; Constant depth circuits; Oracle separations; Polynomial time classes; Turing machines

Indexed keywords

EID: 0345767121     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00061-9     Document Type: Article

References (35)

1. E. Allender, U. Hertrampf, Depth reduction for circuits of unbounded fan-in, Inform. and Comput. 112 (1994) 217-238.
2. J.L. Balcázar, J. Díaz, J. Gabarró, Structural Complexity I, 2nd ed., Texts in Theoretical Computer Science, Springer, Berlin, 1995.
3. 1, J. Comput. System Sci. 38 (1989) 150-164.
4. D.A.M. Barrington, Quasipolynomial size circuit classes, in: Proc. 7th Structure in Complexity Theory, IEEE Computer Society Press, Silver Spring, MD, 1992, 86-93.
5. D.A.M. Barrington, N. Immerman, Time, hardware, and uniformity, in: L.A. Hemaspaandra, A. Selman (Eds.), Complexity Theory Retrospective II, Springer, New York, 1997, pp. 1-22.
6. 1, J. Comput. and System Sci. 41 (1990) 274-306.
7. R. Beigel, The polynomial method in circuit complexity, in: Proc. 8th Structure in Complexity Theory, IEEE Computer Society Press, Silver Spring, MD, 1993. Revised version, 1995, pp. 82-95.
8. R. Beigel, Perceptrons, PP, and the polynomial hierarchy, Comput. Complexity 4 (1994) 339-349.
9. PH hierarchy, in: Proc. 12th Conference on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 1997, pp. 165-172.
10. R.B. Boppana, M. Sipser, The complexity of finite functions, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. A, Elsevier, Amsterdam, 1990, pp. 757-804.
11. B. Borchert, R. Silvestri, The general notion of a dot operator, in: Proc. 12th Conf. on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 1997, pp. 26-44.
12. D.P. Bovet, P. Crescenzi, Introduction to the Theory of Complexity, International Series in Computer Science, Prentice-Hall, London, 1994.
13. D.P. Bovet, P. Crescenzi, R. Silvestri, A uniform approach to define complexity classes, Theoret. Comput. Sci. 104 (1992) 263-283.
14. L. Fortnow, Counting complexity, in: L.A. Hemaspaandra, A. Selman (Eds), Complexity Theory Retrospective II, Springer, New York, 1997, pp. 81-107.
15. M. Furst, J.B. Saxe, M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Math. Systems Theory 17 (1984) 13-27.
16. L.M. Goldschlager, I. Parberry, On the construction of parallel computers from various bases of boolean functions, Theoret. Comput. Sci. 43 (1986) 43-58.
17. PH, Inform. Process. Lett. 37 (1991) 149-153.
18. F. Green, J. Köbler, K. Regan, T. Schwentick, J. Torán, The power of the middle bit of a #P function, J. Comput. and System Sci. 50 (1995) 456-467.
19. J. Håstad, Computational Limitations of Small Depth Circuits, MIT Press, Cambridge, 1988.
20. U. Hertrampf, C. Lautemann, T. Schwentick, H. Vollmer, K.W. Wagner, On the power of polynomial time bit-reductions, in: Proc. 8th Structure in Complexity Theory, 1993, pp. 200-207.
21. B. Jenner, P. McKenzie, D. Thérien, Logspace and logtime leaf languages, in: 9th Annual Conf. Structure in Complexity Theory, 1994, 242-254.
22. K.-I. Ko, Relativized polynomial time hierarchies having exactly k levels, SIAM Journal on Computing, 18 (1989) 392-408.
23. 0 for free, in: Proc. 10th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 665, Springer, Berlin, 1993, pp. 545-554.
24. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
25. K. Regan, Polynomials and combinatorial definitions of languages, in: L.A. Hemaspaandra, A.L. Selman (Eds), Complexity Theory Retrospective II, Springer, Berlin, 1997, pp. 261-293.
26. K. Regan, H. Vollmer, Gap-languages and log-time complexity classes, Theoret. Comput. Sci. (1997), to appear.
27. L. Stockmeyer, The polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1997) 1-22.
28. S. Toda, PP is as hard as the polynomial time hierarchy, SIAM J. Computing 20 (1991) 865-877.
29. S. Toda, O. Watanabe, Polynomial time 1-Turing reductions from #ph to #p, Theoret. Comput. Sci. 100 (1992) 205-221.
30. N.K. Vereshchagin, Relativizable and non-relativizable theorems in the polynomial theory of algorithms, Izvestija Rossijskoj Akademii Nauk, 57 (1993) 51-90 (in Russian).
31. H. Vollmer, On different reducibility notions for function classes, in: Proc. 11th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 775, Springer, Berlin, 1994, pp. 449-460.
32. H. Vollmer. Relations among parallel and sequential computation models, in: Proc. 2nd Asian Computing Science Conference, Lecture Notes in Computer Science, vol. 1179, Springer, Berlin, 1996, pp. 23-32.
33. H. Vollmer, A generalized quantifier concept in computational complexity theory, Tech. Rep. Institut für Informatik, Universität Würzburg, 1997.
34. K.W. Wagner, Bounded query classes, SIAM J. on Computing 19 (1990) 833-846.
35. A.C.C. Yao, Separating the polynomial-time hierarchy by oracles, in: Proc. 26th Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, 1985, pp. 1-10.