Separating complexity classes using structural properties

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 130-138

  Buhrman, Harry ^a   Torenvliet, Leen ^b  

^a CWI   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY CLASSES; DELTA LEVELS; EXPONENTIAL; STRUCTURAL PROPERTIES;

COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; QUERY LANGUAGES; THEOREM PROVING;

SET THEORY;

EID: 4944263272     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. E. Allender. Circuit complexity before the dawn of the new nrilleniam. In Proceedings 16th Foundations of Software Technology and Theoretical Computer Science, volume 1180 of Lecture Notes in Computer Science, pages 1-18. Springer Verlag, 1996.
2. T. Baker, J. Gill, and R. Solovay. Relativizations of the P =? NP question. SIAM J. Camput., 4(4):431-441, Dec. 1975.
3. L. Berman. Polynomial Reducibilities and Complete Sets. PhD thesis, Cornell University, 1977.
4. H. Buhrman, A. Hoene, and L. Torenvliet Splittings, robustness and structure of complete sets. SIAM Journal on Computing, 27(3):637-653, 1998.
5. H. Buhrman, D. van Melkebeek, L. Fortnow, and L. Torenvliet. Using autoreducibility to separate complexity classes. Siam Journal on Computing, 29(5):1497-1520, 2000.
6. A. Degtev. tt and m-degrees. Alg. Log., 12:143-161, 1973.
7. L. Hemaspaandra and M. Ogihara. The Complexity Theory Companion. Springer Verlag, 2002.
8. R. Impagliazzo and A. Wigderson. P=BPP unless E has subexponential circuits. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 220-229. ACM Press, 1997.
9. E. Post Recursively enumerable sets of integers and their decision problems. Bull. Amer. Math. Soc., 50:284-316, 1944.
10. A. Selman. P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Math. Systems Theory, 13:55-65, 1979.
11. H. Vollmer. Relating polynomial time to constant depth. Theoretical Computer Science, 207(1):159-170, 1998.