Abstract
It is not known whether complete languages exist for NP∩CoNP and Sipser has shown that there are relativizations so that NP∩CoNP has no ≤ P m -complete languages. In this paper we show that NP∩CoNP has ≤ P m -complete languages if and only if it has ≤ P T -complete languages. Furthermore, we show that if a complete language L 0 exists for NP∩CoNP and NP∩CoNP≠NP then the reduction of L(N t) ε NP∩CoNP cannot be effectively computed from N t. We extend the relativization results by exhibiting an oracle E such that P E≠NP E∩CoNP E≠NP E and for which there exist complete languages in the intersection. For this oracle the reduction to a complete language can be effectively computed from complementary pairs of machines (N t, N j) such that L(N t)=\(\overline {L(N_1 )} \). On the other hand, there also exist oracles F such that P F≠NP F∩CoNP F≠NP F for which the intersection has complete languages, but the reductions to the complete language cannot be effectively computable from the complementary pairs of machines. In this case, the reductions can be computed from
Supported in part by National Science Foundation Grant DCR8301766.
Research supported by an NSF Postdoctoral Fellowship.
Preview
Unable to display preview. Download preview PDF.
References
Baker, T., J. Gill and R. Solovay. “Relativization of the P=?NP Question”. SIAM Journal of Computing (1975), 431–442.
Garey, M.R. and D.S. Johnson. “Computers and Intractability: A guide to the Theory of NP-Completeness”. W.H. Freeman and Co., San Francisco, 1979.
Kowalczyk, W. “Some Connections Between Representability of Complexity Classes and the Power of Formal Systems of Reasoning”. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 176. Springer-Verlag 1984, 364–369.
Rogers, J., Jr. “Theory of Recursive Functions and Effective Computability”. McGraw-Hill, New York, 1967.
Sipser, M. “On Relativization and the Existence of Complete Sets”. Automata Languages and Programming Lecture Notes in Computer Science 140. Springer-Verlag 1982, 523–531.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartmanis, J., Immerman, N. (1985). On complete problems for NP∩CoNP . In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015750
Download citation
DOI: https://doi.org/10.1007/BFb0015750
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15650-5
Online ISBN: 978-3-540-39557-7
eBook Packages: Springer Book Archive