On complete problems for NPCoNP

  • Juris Hartmanis
  • Neil Immerman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 194)

Abstract

It is not known whether complete languages exist for NPCoNP and Sipser has shown that there are relativizations so that NPCoNP has no ≤mP-complete languages. In this paper we show that NPCoNP has ≤mP-complete languages if and only if it has ≤TP-complete languages. Furthermore, we show that if a complete language L0 exists for NPCoNP and NPCoNPNP then the reduction of L(Nt) ε NPCoNP cannot be effectively computed from Nt. We extend the relativization results by exhibiting an oracle E such that PENPECoNPENPE 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 (Nt, Nj) such that L(Nt)=\(\overline {L(N_1 )} \). On the other hand, there also exist oracles F such that PFNPFCoNPFNPF 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
$$(N_t ,N_J , Proof that L(N_1 ) = \overline {L(N_1 )} ) .$$

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BGS]
    Baker, T., J. Gill and R. Solovay. “Relativization of the P=?NP Question”. SIAM Journal of Computing (1975), 431–442.Google Scholar
  2. [GJ]
    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.Google Scholar
  3. [Ko]
    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.Google Scholar
  4. [Ro]
    Rogers, J., Jr. “Theory of Recursive Functions and Effective Computability”. McGraw-Hill, New York, 1967.Google Scholar
  5. [Si]
    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.Google Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • Juris Hartmanis
    • 1
  • Neil Immerman
    • 2
  1. 1.Department of Computer ScienceCornell UniversityIthaca
  2. 2.Department of Computer ScienceYale UniversityNew Haven

Personalised recommendations