On the Structure of Polynomial Time Reducibility

@article{Ladner1975OnTS,
  title={On the Structure of Polynomial Time Reducibility},
  author={Richard E. Ladner},
  journal={J. ACM},
  year={1975},
  volume={22},
  pages={155-171}
}
Two notions of polynomml time reduclbihty, denoted here by ~ T e and <.~P, were defined by Cook and Karp, respectively The abstract propertms of these two relatmns on the domain of computable sets are investigated. Both relations prove to be dense and to have minimal pairs. Further , there is a strictly ascending sequence with a minimal pair of upper bounds to the sequence. Our method of showing density ymlds the result that if P ~ NP then there are members of NP -P that are not polynomml… 

P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP

  • A. Selman
  • Mathematics
    Mathematical systems theory
  • 2005
It is proved that for every tally language set in NP there exists a polynomial time equivalent set inNP that isp-selective, and it follows that if NEXT ≠ DEXT, then polynometric time Turing and many-one reducibilities differ onNP.

Strong Polynomial-Time Reducibility

P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP

It is proved that for m every tally language set in NP there exists a polynomial time equivalent set inNP that is p-selective, and from this result it follows that if NEXT ~ DEXT, then polynometric time Turing and many-one reducibilities differ on NP.

Randomness, Relativizations, and Polynomial Reducibilities

  • K. Ambos-Spies
  • Mathematics, Computer Science
    Computational Complexity Conference
  • 1986
It is shown that any class, which in the relativized case collapses to P with probability one, is actually contained in BPP, the class of problems which can be probabilisticly solved with uniformly bounded error probability in polynomial time.

Undecidability and Definability for Parametrized Polynomial Time m-Reducibilities

In the setting of the parametrized reducibilities introduced by the second author and Mike Fellows, we prove a number of decidability and definability results. In particular the undecidability of the

Nondiamond Theorems for Polynomial Time Reducibility

  • R. Downey
  • Mathematics
    J. Comput. Syst. Sci.
  • 1992

Minimal Pairs for Polynomial Time Reducibilities

It is shown that for every recursive set A∉P there is a recursive set B such that A and B form a minimal pair and similar results for pairs without greatest predecessors are proved.

On Nondeterminism, Enumeration Reducibility and Polynomial Bounds

A polynomial time enumeration reducibility is defined that retains the character of enumeration Redux and it is shown that it is equivalent to conjunctive non‐deterministic polynometric time reducible.

Inclusion complete tally languages and the Hartmanis-Berman conjecture

The method used is applicable to questions regarding the comparison of a wide range of pairs of classes of formal languages specified by machines whose computational resources are bounded in time or space.
...

References

SHOWING 1-10 OF 28 REFERENCES

Comparison of polynomial-time reducibilities

Comparison of the polynomial-time-bounded reducibilities introduced by Cook [1] and Karp] leads naturally to the definition of several intermediate truth-tableredcibilities, and it is noted that all redu cibilities of this type which do not have obvious implication relationships are in fact distinct in a strong sense.

The complexity of theorem-proving procedures

  • S. Cook
  • Mathematics, Computer Science
    STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a

Every Prime has a Succinct Certificate

  • V. Pratt
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1975
It remains an open problem whether a prime n can be recognized in only $\log _2^\alpha n$ operations of a Turing machine for any fixed $\alpha $.

Augmented Loop Languages and Classes of Computables Functions

The Upper Semi-Lattice of Degrees of Recursive Unsolvability

The concept 'degree of recursive unsolvability' was introduced briefly in Post [16]. In his abstract [17] the concept was formulated precisely via an extension of [15], and a resulting partial scale

Word problems requiring exponential time(Preliminary Report)

A number of similar decidable word problems from automata theory and logic whose inherent computational complexity can be precisely characterized in terms of time or space requirements on deterministic or nondeterministic Turing machines are considered.

Recursively enumerable sets of positive integers and their decision problems

Introduction. Recent developments of symbolic logic have considerable importance for mathematics both with respect to its philosophy and practice. That mathematicians generally are oblivious to the

On a subrecursive hierarchy and primitive recursive degrees

Kleene makes a new attempt at a classification of general recursive functions, by using the notion of relative primitive recursiveness and of the uniform effective enumerability of the functions primitive recursive in an assumed function.

CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS

A sequence of classes of computable functions for which a prediction of the complexity of the calculation may be made in a comparatively simple fashion, each defined as the class of functions whose computational complexity is "predictable" by a function in the preceding class.

Dense and Non-Dense Families of Complexity Classes

D density is not a measure invariant property of ΣΦ or ΩΦ, but ΩL is not dense in ΣL, and these are the first examples of important structural properties of these families of Φ-complexity classes which are not measure invariants.