Advertisement

On the relative complexity of subproblems of intractable problems

  • Klaus Ambos-Spies
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 182)

Abstract

A subproblem of a problem A is the restriction of A to some polynomial time computable set. A set A is subproblem complete (s.c.) if every polynomial time (p-) degree below the p-degree of A contains a subproblem of A. A is decomposition complete (d.c.) if every splitting of the p-degree of A is witnessed by a decomposition of A into two subproblems. We show that all p-cylinders and thus most of the "natural" problems are s.c. and d.c. with respect to p-many-one (Karp) reducibility. We also show, however, that not every problem has these properties. Furthermore, we discuss these completeness properties with respect to p-Turing (Cook) reducibility.

Keywords

Polynomial Time Natural Problem Complete Problem Intractable Problem Completeness Property 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AS1.
    K. Ambos-Spies, P-mitotic sets, in "Logic and Machines: Decision Problems and Complexity" (E.Börger et al., Eds.), Springer Lecture Notes Comp. Sc., vol. 171 (1984), 1–23.Google Scholar
  2. AS2.
    K. Ambos-Spies, On the structure of polynomial time degrees, in "STACS 84, Symposium on Theoretical Aspects of Computer Science" (M.Fontet and K.Mehlhorn, Eds.), Springer Lecture Notes Comp. Sc., vol. 166 (1984), 198–208.Google Scholar
  3. AS3.
    K.Ambos-Spies, Inhomogeneities in the polynomial time degrees: the degrees of super sparse sets, preprint.Google Scholar
  4. BGS.
    T. Baker, J. Gill and R. Solovay, Relativizations of the P=?NP question, SIAM J. Computing 4 (1975) 431–442.Google Scholar
  5. BH.
    L. Berman and J. Hartmanis, On isomorphisms and density of NP and other complete sets, SIAM J. Computing 6 (1977) 305–322.Google Scholar
  6. Co.
    S.A.Cook, The complexity of theorem proving procedures, Proc. Third Annual ACM Symp. on Theory of Computing (1971), 151–158.Google Scholar
  7. GJ.
    M.R.Garey and D.S.Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, H.Freeman, 1978, San Francisco.Google Scholar
  8. HU.
    uJ.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979, Reading, MA.Google Scholar
  9. Ka.
    R.M. Karp, Reducibility among combinatorial problems, in "Complexity of Computer Computations" (R.E. Miller and J.W. Thatcher, Eds.), 1972, Plenum, New York, 85–103.Google Scholar
  10. La.
    R.E. Ladner, On the structure of polynomial time reducibility, J.ACM 22 (1975) 155–171.Google Scholar
  11. LLS.
    R.E. Ladner, N. Lynch and A.L. Selman, A comparison of polynomial time reducibilities, Theor. Comp. Sci. 1 (1975) 103–123.Google Scholar
  12. Ro.
    H. Rogers, Jr., The Theory of Recursive Functions and Effective Computability, 1967, McGraw-Hill, New York.Google Scholar
  13. Si.
    I.Simon, Two results on polynomial time reducibilities, Sigact News, February 1976.Google Scholar
  14. SG.
    I.Simon and J.Gill, Polynomial reducibilities and upward diagonalizations, Proc. Ninth Ann. ACM Symp. on Theory of Computing (1977), 186–194.Google Scholar
  15. Yo.
    P.Young, Some structural properties of polynomial time reducibilities and sets in NP, Proc. Fifteenth Ann. ACM Symp. on Theory of Computing (1983), 392–401.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Klaus Ambos-Spies
    • 1
  1. 1.Lehrstuhl für Informatik IIUniversität DortmundGermany

Personalised recommendations