The operators min and max on the polynomial hierarchy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 93-104

  Hempel, Harald ^a   Wechsung, Gerd ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLEXITY CLASS; INCLUSION STRUCTURE; POLYNOMIAL HIERARCHIES; STRUCTURAL ASSUMPTION;

POLYNOMIALS;

EID: 84949649269     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023451     Document Type: Conference Paper

References (21)

1. [BDG95] J.L. Balcázar, J. Diaz and J. Gabarró. Structural Complexity I. Springer Berlin-Heidelberg-New York, 2nd ed., 1995.
2. [BDG90] J.L. Balcázar, J. Diaz and J. Gabarró. Structural Complexity II. Springer Berlin-Heidelberg-New York, 1990.
3. [CT95] Z.-Z. Chen and S. Toda. The Complexity of Selecting Maximal Solutions. Information and Computation, 119(1):231-239, 1995.
4. [GKR95] W.I. Gasarch, M.W. Krentel and K.J. Rappoport. OptP as the Normal Behavior of NP-Complete Problems. Mathematical Systems Theory, 28:487-514, 1995.
5. [HV95] L. Hemaspaandra and H. Vollmer. The Satanic notations: Counting classes beyond #P and other definitional adventures. SIGACT News, 26(1):2-13, 1995.
6. [Köb89] J. Köbler. Strukturelle Komplexität von Anzahlproblemen. PhD thesis, Uniυersität Stuttgart, Fakultät für Informatik, Stuttgart, Germany, 1989.
7. [KST89] J. Köbler, U. Schöning and J. Torán. On counting and approximation. Acta Information, 26:363-379, 1989.
8. [Kre88] M.W. Krentel. The complexity of optimization problems. Journal of Computer and Systems Sciences, 36:490-509, 1988.
9. [Kre92] M.W. Krentel. Generalizations of OptP to the polynomial hierarchy. Theoretical Computer Science, 97:183-198. 1992.
10. [Ogi91] M. Ogiwara. Characterizing low levels of the polynomial-time hierarchy relative to C=P via metric turing machines. Technical Report C-101, Tokyo Institute of Technology, Department of Information Science, Tokyo, Japan, 1991.
11. [OH93] M. Ogiwara and L. Hemachandra. A complexity theory for feasible closure properties. Journal of Computer and Systems Sciences, 46:295-325, 1993.
12. [Pap94] C. Papadimitriou. Computational Complexity. Addis on-Wesley, 1994.
13. [PZ83] C. Papadimitriou and S. Zachos. Two remarks on the power of counting. Proceedings 6th GI Conference on Theoretical Computer Science, 269-276. Springer Verlag, Lecture Notes in Computer Science # 145, 1983.
14. [Tod91] S. Toda. Computational Complexity of Counting Complexity Classes. PhD thesis, Tokyo Institute of Technology, Department of Computer Science, Tokyo, Japan, 1991.
15. [Val79a] L.G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
16. [Val79b] L.G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979.
17. [Vol94] H. Vollmer. Komplexitätsklassen von Funktionen. PhD thesis, Uniυersität Würzburg, Institut für Informatik, Würzburg, Germany, 1994.
18. [VW93] H. Vollmer and K.W. Wagner. The complexity of finding middle elements. International Journal of Foundations of Computer Science, 4:293-307, 1993.
19. [VW95] H. Vollmer and K.W. Wagner. Complexity Classes of Optimization Functions. Information and Computation, 120(2): 198-219, 1995
20. [Wag86] K.W. Wagner. Some observations on the connection between counting and recursion. Theoretical Computer Science, 47:131-147, 1986.
21. [Wag87] K.W. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science, 51:53-80, 1987.