The Density and Complexity of Polynomial Cores for Intractable Sets

Let A be a recursive problem not in P. Lynch has shown that A then has an infinite recursive polynomial complexity core. This is a collection C of instances of A such that every algorithm deciding A needs more than polynomial time almost everywhere on C. We investigate the complexity of recognizing the instances in such a core, and show that every recursive problem A not in P has an infinite core recognizable in subexponential time. We further study how dense the core sets for A can be, under various assumptions about the structure of A. Our main results in this direction are that if P ≠ NP, then NP-complete problems have polynomially nonsparse cores recognizable in subexponential time, and that EXPTIME-complete problems have cores of exponential density recognizable in exponential time.

[1]  L. Berman.  Polynomial reducibilities and complete sets. , 1977 .

[2]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[3]  Daniel J. Moore,et al.  Completeness, Approximation and Density , 1981, SIAM J. Comput..

[4]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[5]  Steven Fortune,et al.  A Note on Sparse Complete Sets , 1978, SIAM J. Comput..

[6]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[7]  Nancy A. Lynch,et al.  On Reducibility to Complex or Sparse Sets , 1975, JACM.

[8]  Richard J. Lipton,et al.  On the Structure of Sets in NP and Other Complexity Classes , 1981, Theor. Comput. Sci..

[9]  Robert Moll,et al.  Examples of hard tautologies in the propositional calculus , 1981, STOC '81.

[10]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Uwe Schöning.  A Uniform Approach to Obtain Diagonal Sets in Complexity Classes , 1982, Theor. Comput. Sci..

[13]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[14]  Piotr Berman.  Relationship Between Density and Deterministic Complexity of NP-Complete Languages , 1978, ICALP.

[15]  Yacov Yacobi,et al.  Hard-core theorems for complexity classes , 1985, JACM.

[16]  Stephen R. Mahaney.  Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..

[17]  Lawrence J. Henschen,et al.  Unit Refutations and Horn Sets , 1974, JACM.

[18]  Osamu Watanabe.  On One-One Polynomial Time Equivalence Relations , 1985, Theor. Comput. Sci..