Relativizing function classes

Journal of Universal Computer Science

Volumn 9, Issue 1, 2003, Pages 34-50

  Glaßer, Christian ^a   Wechsung, Gerd ^b  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Function classes; Oracle separations; Polynomial time hierarchy

Indexed keywords

EID: 11144301574     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (17)

1. [BGS75] T. Baker, J. Gill, and R. Solovay. Relativizations of the P=NP problem. SIAM Journal on Computing, 4:431-442, 1975.
2. [HW97] H. Hempel and G. Wechsung. The operators min and max on the polynomial time hierarchy. In Proceedings 14th Symposium on Theoretical Aspects of Computer Science, volume 1200 of Lecture Notes in Computer Science, pages 93-104. Springer Verlag, 1997.
3. [Köb89] J. Köbler. Strukturelle Komplexität von Anzahlproblemen. PhD thesis, Universität Stuttgart, Fakultät für Informatik, 1989.
4. [Kre88] M. W. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36:490-509, 1988.
5. [Kre92] M. W. Krentel. Generalizations of OptP to the polynomial hierarchy. Theoretical Computer Science, 97:183-198, 1992.
6. [KST89] J. Köbler, U. Schiöning, and J. Torán. On counting and approximation. Acta Informatica, 26:363-379, 1989.
7. [KSV98] S. Kosub, H. Schmitz, and H. Vollmer. Uniformly defining complexity classes of functions. In Proceedings 15th Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 607-617. Springer Verlag, 1998.
8. [OH93] M. Ogiwara and L. Hemachandra. A complexity theory of feasible closure properties. Journal of Computer and System Sciences, 46:295-325, 1993.
9. [Rac82] C. Rackoff. Relativized questions involving probabilistic algorithms. Journal of the ACM, 29:261-268, 1982.
10. [Tod89] S. Toda. On the computational power of PP and ParityP. In Proceedings 30th IEEE Symposium on Foundations of Computer Science, pages 514-519. IEEE Computer Society Press, 1989.
11. [Tod91] S. Toda. Computational Complexity of Counting Complexity Classes. PhD thesis, Tokyo Institute of Technology, Department of Computer Science, Tokyo, 1991.
12. [Tor91] J. Torán. Complexity classes defined by counting quantifiers. Journal of the Association for Computing Machinery, 38:753-774, 1991.
13. [Val79a] L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
14. [Val79b] L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal of Computing, 8(3):411-421, 1979.
15. [Vol94] H. Vollmer. Komplexitätsklassen von Funktionen. PhD thesis, Universität Würzburg, Institut für Informatik, Germany, 1994.
16. [VW95] H. Vollmer and K. W. Wagner. Complexity classes of optimization functions. Information and Computation, 120:198-219, 1995.
17. [Yao85] A. C. C. Yao. Separating the polynomial-time hierarchy by oracles. In Proceedings 26th Foundations of Computer Science, pages 1-10. IEEE Computer Society Press, 1985.