Constant depth circuits and the Lutz hypothesis

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1997, Pages 595-604

  Cai, Jin Yi ^a   Sivakumar, D ^a   Strauss, Martin ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; LOGIC CIRCUITS; LOGIC GATES; POLES AND ZEROS; POLYNOMIALS; THEOREM PROVING;

CONSTANT DEPTH CIRCUITS; LUTZ HYPOTHESIS; RESOURCE BOUNDED MEASURE THEORY;

PROBABILISTIC LOGICS;

EID: 0031353464     PISSN: 02725428     EISSN: None     Source Type: None    
DOI: 10.1109/SFCS.1997.646149     Document Type: Conference Paper

References (19)

1. E. Allender M. Strauss Measure on small complexity classes, with applications for BPP 35th FOCS 807 818 35th FOCS 1994
2. N. Alon L. Babai A. Itai A fast and simple randomized parallel algorithm for the maximal independent set problem Journal of Algorithms 7 567 583 1986
3. N. Alon J. Spencer The Probabilistic Method 1992 Wiley
4. J.-Y. Cai With Probability One, a Random Oracle Separates PSPACE from the Polynomial-time Hierarchy Journal of Computer and System Sciences 38 68 85 1989
5. J. Håstad Randomness and Computation 143 170 1989 JAI Press Almost optimal lower bounds for small depth circuits
6. R. Kannan Circuit-size lower bounds and non-reducibility to sparse sets Information and Control 55 40 56 1982
7. J. Lutz Almost everywhere high nonuniform complexity Journal of Computer and System Sciences 44 220 258 1992
8. J. Lutz The quantitative structure of exponential time 8th Structures 158 175 8th Structures 1993
9. J. Lutz Observations on measure and lowness for Δp2 13th STACS 87 97 13th STACS 1996
10. J. Lutz E. Mayordomo Measure, stochasticity, and the density of hard languages SIAM Journal on Computing 23 762 779 1994
11. E. Mayordomo Contributions to the Study of Resource-Bounded Measure 1994 Universitat Politecnica de Catalunya Barcelona
12. J. Lutz E. Mayordomo Cook versus Karp-Levin: Separating completeness notions if NP is not small 11th STACS 415 426 11th STACS 1994
13. N. Nisan Pseudorandom bits for constant-depth circuits Combinatorica 11 63 70 1991
14. N. Nisan A. Widgerson Hardness vs. randomness 29th FOCS 2 11 29th FOCS 1988
15. A. A. Razborov S. Rudich Natural proofs 26th STOC 204 213 26th STOC 1994
16. K. Regan D. Sivakumar J.-Y. Cai Pseudorandom generators, measure theory, and natural proofs 36th FOCS 26 35 36th FOCS 1995
17. L. J. Stockmeyer The polynomial-time hierarchy Theoretical Computer Science 3 1 22 1977
18. M. Strauss Measure on P: strength of the notion Information and Computation 1997
19. A. Yao Separating the polynomial-time hierarchy by oracles 26th FOCS 1 10 26th FOCS 1985