On proving circuit lower bounds against the polynomial-time hierarchy

SIAM Journal on Computing

Volumn 33, Issue 4, 2004, Pages 984-1009

  Cai, Jin Yi ^a   Watanabe, Osamu ^b  

^a University of Wisconsin Madison   (United States)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Circuit complexity; Computational complexity; Nisan Wigderson generator; Stringent relativization; Switching Lemma

Indexed keywords

CIRCUIT COMPLEXITY; NISAN-WIGDERSON GENERATOR; STRINGENT RELATIVIZATION; SWITCHING LEMMA;

HIERARCHICAL SYSTEMS; NETWORKS (CIRCUITS); POLYNOMIAL APPROXIMATION; PROBABILITY; THEOREM PROVING; TREES (MATHEMATICS);

COMPUTATIONAL COMPLEXITY;

EID: 4544233615     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703422716     Document Type: Article

References (28)

1. 1 -formulae on finite structures, Ann. Pure Appl. Logic, 24 (1983), pp. 1-48.
2. [Bab87] L. BABAI, Random oracles separate PSPACE from the polynomial-time hierarchy, Inform. Process. Lett., 26 (1987), pp. 51-53.
3. [BCGKT] N. BSHOUTY, R. CLEVE, R. GAVALDÀ, S. KANNAN, AND C. TAMON, Oracles and queries that are sufficient for exact learning, J. Comput. System Sci., 52 (1996), pp. 421-433.
4. [BFT98] H. BUHRMAN, L. FORTNOW, AND T. THIERAUF, Nonrelativizing separations, in Proceedings of the 13th IEEE Conference on Computational Complexity (CCC'98), IEEE Computer Society Press, Los Alamitos, CA, 1998, pp. 8-12.
5. [Cai86] J.-Y. CAI, With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy, in Proceedings of the 18th ACM Symposium on Theory of Computing (STOC'86), ACM, New York, 1986, pp. 21-29. See also the journal version in J. Comput. System Sci., 38 (1989), pp. 68-85.
6. [Cai86] J.-Y. CAI, With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy, in Proceedings of the 18th ACM Symposium on Theory of Computing (STOC'86), ACM, New York, 1986, pp. 21-29. See also the journal version in J. Comput. System Sci., 38 (1989), pp. 68-85.
7. NP, in Proceedings of the 42th IEEE Symposium on Foundations of Computer Science (FOCS'01), IEEE Computer Society Press, Los Alamitos, CA, 2001, pp. 620-628.
8. [CW03] J.-Y. CAI AND O. WATANABE, On proving circuit lower bounds against the polynomialtime hierarchy: Positive and negative results, in Proceedings of the 9th International Computing and Combinatorics Conference (COCOON'03), Lecture Notes in Comput. Sci. 2697, Springer-Verlag, Berlin, 2003, pp. 202-211.
9. [CW04] J.-Y. CAI AND O. WATANABE, BPP = PH by polynomially stringent relativization, Inform. Process. Lett., to appear.
10. [FSS81] M. FÜRST, J. SAXE, AND M. SIPSER, Parity, circuits, and the polynomial time hierarchy, in Proceedings of the 22nd IEEE Symposium on Foundations of Computer Science (FOCS'81), IEEE Computer Society Press, Los Alamitos, CA, 1981, pp. 260-270.
11. [DK00] D.-Z. Du AND K.-I Ko, Theory of Computational Complexity, John Wiley & Sons, New York, 2000.
12. [Hås86a] J. HÅSTAD, Almost optimal lower bounds for small depth circuits, in Proceedings of the 18th ACM Symposium on Theory of Computing (STOC'86), ACM, New York, 1986, pp. 6-20.
13. [Hås86b] J. HÅSTAD, Computational Limitations for Small-Dept Circuits, MIT Press, Cambridge, MA, 1986.
14. [He84] H. HELLER, On relativized polynomial and exponential computations, SIAM J. Comput., 13 (1984), pp. 717-725.
15. [HPV77] J. E. HOPCROFT, W. J. PAUL, AND L. G. VALIANT, On time versus space, J. ACM, 24 (1977), pp. 332-337.
16. [Kan82] R. KANNAN, Circuit-size lower bounds and non-reducibility to sparse sets, Inform. and Control, 55 (1982), pp. 40-56.
17. [KL80] R. M. KARP AND R. J. LIPTON, Some connections between nonuniform and uniform complexity classes, in Proceedings of the 12th ACM Symposium on Theory of Computing (STOC'80), ACM, New York, 1980, pp. 302-309.
18. [Ko89a] K.-I Ko, Relativized polynomial time hierarchies having exactly k levels, SIAM J. Comput., 18 (1989), pp. 392-408.
19. [KW98] J. KÖBLER AND O. WATANABE, New collapse consequences of NP having small circuits, SIAM J. Comput., 28 (1998), pp. 311-324.
20. [MVW99] P. B. MILTERSEN, N. V. VINODCHANDRAN, AND O. WATANABE, Super-polynomial versus half-exponential circuit size in the exponential hierarchy, in Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON'99), Lecture Notes in Comput. Sci. 1627, Springer-Verlag, Berlin, 1999, pp. 210-220.
21. [MR95] R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
22. [Nis91a] N. NISAN, Pseudorandom bits for constant depth circuits, Combinatorica, 11 (1991), pp. 63-70.
23. [Nis91b] N. NISAN, Using Hard Problems to Create Pseudorandom Generators, MIT Press, Cambridge, MA, 1991.
24. [NW88] N. NISAN AND A. WIGDERSON, Hardness vs. randomness, in Proceedings of the 29th IEEE Symposium on Foundations of Computer Science (FOCS'88), IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 2-12.
25. [NW94] N. NISAN AND A. WIGDERSON, Hardness vs. randomness, J. Comput. System Sci., 49 (1994), pp. 149-167.
26. [vL91] J. VAN LINT, Introduction to Coding Theory, 2nd ed., Springer-Verlag, Berlin, 1992.
27. [Wil83] C. B. WILSON, Relativized circuit complexity, in Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (FOCS'83), IEEE Computer Society Press, Los Alamitos, CA, 1983, pp. 329-334.
28. [Yao85] A. C. YAO, Separating the polynomial-time hierarchy by oracles, in Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (FOCS'85), IEEE Computer Society Press, Los Alamitos, CA, 1985, pp. 1-10.