Hierarchies for semantic classes

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 348-355

  Fortnow, Lance ^a   Santhanam, Rahul ^a   Trevisan, Luca ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Advice; Hierarchy theorems; Semantic classes

Indexed keywords

ADVICE; HIERARCHY THEOREMS; SEMANTIC CLASSES;

EQUIVALENCE CLASSES; SEMANTICS; THEOREM PROVING;

HIERARCHICAL SYSTEMS;

EID: 34247467131     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060642     Document Type: Conference Paper

References (16)

1. ALLENDER, E., BEIGEL, R., HERTRAMPF, U., AND HOMER, S. Almost-everywhere complexity hierarchies for nondeterministic time. Theoretical Computer Science 115, 2 (19 July 1993), 225-241.
2. BALCÁZAR, J. L., DÍAZ. J., AND GABARRÓ, J. Structural Complexity 1. Springer-Verlag, New York, NY, 1988.
3. BALCÁZAR, J. L., DÍAZ, J., AND GABARRÓ, J. Structural Complexity 2. Springer-Verlag, New York, NY, 1990.
4. BARAK, B. A probabilistic-time hierarchy theorem for "Slightly Non-uniform" algorithms. Lecture. Notes in Computer Science 2483 (2002), 194-208.
5. COOK. S. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (1971), pp. 151-158.
6. COOK, S. A hierarchy for nondeterministic time complexity. In Conference Record, Fourth Annual ACM Symposium on Theory of Computing (Denver, Colorado, 1-3 May 1972), pp. 187-192.
7. FORTNOW, L., AND SANTHANAM, R. Hierarchy theorems for probabilistic polynomial time. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (2004), pp. 316-324.
8. GOLDREICH, O., SUDAN, M., AND TREVISAN, L. From logarithmic advice to single-bit advice. Electronic Colloquium on Computational Complexity, TR04-093 (2004).
9. HARTMANIS, J., AND STEARNS, R. E. On the computational complexity of algorithms. Trans. Amer. Math. Soc. (AMS) 117 (1965), 285-306.
10. KABANETS, V., AND IMPAGLIAZZO, R. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity 13, 1-2 (2004), 1-46.
11. KARP, R., AND LIPTON, R. Turing machines that take advice. L'Enseignement Mathématique 28, 2 (1982), 191-209.
12. KARPINSKI, M., AND VERBEEK, R. On the monte carlo space constructible functions and separation results for probabilistic complexity classes. Information and Computation 75 (1987).
13. LEVIN, L. Universal search problems(in russian). Problemy Peredachi Informatsii 9, 3 (1973), 265-266.
14. PAPADIMITRIOU, C. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences 48, 3 (1994), 498-532.
15. SIPSER, M. On relativization and the existence of complete sets. In Proceedings of 9th International Colloquium on Automata, Languages and Programming (1982), pp. 523-531.
16. ŽÁK. S. A Turing machine time hierarchy. Theoretical Computer Science 26, 3 (Oct. 1983), 327-333.