Abstract
Starting from NP-complete problems defined by questions of the kind "max ... ≥ k?" and "min ... ≤ k?" we consider problems defined by more complicated questions about these maxima and minima, as for example "max ... = k?", "min ... ε M?" and "is max ... odd?". This continues a work started by Papadimitriou and Yannakakis in [PaYa 82]. It is shown that these and other problems are complete in certain subclasses of the Boolean closure of NP and other classes in the interesting area below the class Δ P2 of the polynomial-time hierarchie. Special methods are developped to prove such completeness results. For this it is necessary to establish some properties of the classes in question which might be interesting in their own right.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
Garey, M.R., Johnson, D.S., Computers and Intractibility: A Guide to the Theory of NP-Completeness, Freeman, San Francisco 1979
Hausdorff, F., Grundzüge der Mengenlehre, Leipzig 1914
Johnson, D.S., The NP-completeness column: an ongoing guide 15th edition, Journal of Algorithms 6(1985), 291–305
Köbler, J., Schöning, U., The difference and truth-table hierarchies for NP, manuscript 1985
Ladner, R.E., Lynch, N.A., Relativizations of questions about log space computability, MST 10(1976), 19–32
Ladner, R.E., Lynch, N.A., Selman, A.L., A comparison of polynomial time reducibilities, TCS 1(1975), 103–123
Papadimitriou, C.H., On the complexity of unique solutions, JACM 31(1984), 392–400
Papadimitriou, C.H., Yannakakis, M., The complexity of facets (and some facets of complexity), 14th STOC (1982), 255–260, see also: JCSS 28(1984), 244–259
Stockmeyer, L.J., Meyer, A.R., Word problems requiring exponential time, 5th STOC (1973), 1–9
Stockmeyer, L.J., The polynomial-time hierarchy, TSC 3(1977), 1–22
Wagner, K., On ω-regular sets, Inf.&Contr. 43(1979), 123–177
Wagner, K., Compact descriptions and the counting polynomial-time hierarchy, Proc. 2nd Frege Conf. (1984), 383–392
Wagner, K., The complexity of graphs with regularities, Proc. 11th MFCS Conf., LNCS 176 (1984), 544–552
Wechsung G., On the Boolean closure of NP, Proc. FCT Conf. 1985, LNCS 199 (1985), 485–493
Wechsung, G., Wagner, K.W., On the Boolean closure of NP, submitted for publication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wagner, K.W. (1986). More complicated questions about maxima and minima, and some closures of NP. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_93
Download citation
DOI: https://doi.org/10.1007/3-540-16761-7_93
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16761-7
Online ISBN: 978-3-540-39859-2
eBook Packages: Springer Book Archive