Abstract
In this paper we introduce a new acceptance concept for nondeterministic Turing machines with output device which allows a characterization of the complexity class Θ p2 = PNP[log] as a polynomial time bounded class. Thereby the internal structure of the output is essential: it looks at output with maximal number of mind changes instead of output with maximal value which was realized for the first time by Krentel [Kre88].
Motivated by this characterization we define in a general way two operators, the so called maxCh- and minCh- operator, respectively which are special types of optimization operators.
Following a paper by Hempel/Wechsung [HW96] we investigate the behaviour of these operators on the polynomial hierarchy. We prove a collection of relations regarding the interaction of operators maxCh, minCh, $, Θ, Θ, Θ, Sig, C and U. So we get a tool to show that the maxCh- and minCh- classes are distinct under reasonable structural assumptions. Finally, our proof techniques allow to solve one of the open questions of Hempel/Wechsung.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Hempel, G. Wechsung. The Operators and max on the Polynomial Time Hierarchy. Proceedings of STACS 97, LNCS 1200, 93–104
J. Köbler, U. Schöning, J. Torán. On counting and approximation. Acta Informatica, 26 (1989), 363–379
M. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36 (1988), 490–509
C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994
S. Toda. Computational Complexity of Counting Complexity Classes. PhD thesis, Tokyo Institute of Technology, Department of Computer Science, Tokyo, Japan, 1991
H. Vollmer. Komplexitätsklassen von Funktionen. PhD thesis, Universität Würzburg, Institut für Informatik, Würzburg, Germany, 1994
K.W. Wagner. Bounded query classes. SIAM Journal on Computing, 19(1990), 833–846
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spakowski, H., Vogel, J. (1999). The operators minCh and maxCh on the polynomial hierarchy. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_44
Download citation
DOI: https://doi.org/10.1007/3-540-48321-7_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66412-3
Online ISBN: 978-3-540-48321-2
eBook Packages: Springer Book Archive