Advertisement

Inverse Problems Have Inverse Complexity

  • Tobias Berg
  • Harald Hempel
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 273)

abstract

In this paper we show that inverting problems of higher complexity is easier than inverting problems of lower complexity. While inverting Σp i3CNFSAT is known to be coNP-complete sideri for i=1 we prove that it remains coNP-complete for i=2 and is in P for all i⩾ 3. Relatedly, we show that inverting Σp i3DNFSAT is in P for all i⩾ 1.

Keywords

Inverse Problem Polynomial Time STEINER Tree Truth Assignment Boolean Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Tobias Berg and Harald Hempel. Inverse problems have inverse complexity, 2008. Technical Report, FSU Jena.Google Scholar
  2. 2.
    Hubie Chen. Inverse NP problems. In Mathematical foundations of computer science 2003, volume 2747 of Lecture Notes in Comput. Sci., pages 338–347. Springer, Berlin, 2003.Google Scholar
  3. 3.
    Michael R. Garey and David S. Johnson. Computers and intractability. W. H. Freeman and Co., San Francisco, Calif., 1979. A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences.Google Scholar
  4. 4.
    Edith Hemaspaandra, Lane A. Hemaspaandra, and Harald Hempel. All superlinear inverse schemes are co NP-hard. Theoret. Comput. Sci., 345(2-3):345–358, 2005.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Lane A. Hemaspaandra and Mitsunori Ogihara. The complexity theory companion. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin, 2002.Google Scholar
  6. 6.
    Dimitris Kavvadias and Martha Sideri. The inverse satisfiability problem. SIAM J. Comput., 28(1):152–163 (electronic), 1999.MathSciNetzbMATHGoogle Scholar
  7. 7.
    Michael Krüger and Harald Hempel. Inverse Hamiltonian cycle and inverse 3-D matching are co NP-complete. In Algorithms and computation, volume 4288 of Lecture Notes in Comput. Sci., pages 243–252. Springer, Berlin, 2006.zbMATHGoogle Scholar
  8. 8.
    Albert R. Meyer and Larry J. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. In FOCS, pages 125–129. IEEE, 1972.Google Scholar
  9. 9.
    Christos H. Papadimitriou. Computational complexity. Addison-Wesley Publishing Company, Reading, MA, 1994.Google Scholar
  10. 10.
    Larry J. Stockmeyer. The polynomial-time hierarchy. Theoret. Comput. Sci., 3(1):1–22 (1977), 1976.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Tobias Berg
    • 1
  • Harald Hempel
    • 1
  1. 1.Fakultät für Mathematik und InformatikFriedrich-Schiller-Universität JenaGermany

Personalised recommendations