Journal Article10.1145/321864.321877
On the Structure of Polynomial Time Reducibility
875
TL;DR: The method of showing density ymlds the result that if P ~ NP then there are members of NP -P that are not polynomml complete is shown, which means there is a strictly ascending sequence with a minimal pair of upper bounds to the sequence.
read more
Abstract: 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 complete
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Why Philosophers Should Care About Computational Complexity
TL;DR: It is argued that computational complexity theory leads to new perspectives on the nature of mathematical knowledge, the strong AI debate, computationalism, the problem of logical omniscience, Hume's problem of induction and Goodman's grue riddle, the foundations of quantum mechanics, economic rationality, closed timelike curves, and several other topics of philosophical interest.
142
•Posted Content
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
TL;DR: In this paper, structural and connectivity-related properties of the space of solutions of Boolean satisfiability problems were studied and various dichotomies in Schaefer's framework were established for the kinds of subgraphs of the hypercube that can be induced by the solutions of boolean formulas, as well as the diameter of the connected components of the solution space.
The Complexity of Constraint Languages
David Cohen,Peter Jeavons +1 more
- 01 Jan 2006
TL;DR: This chapter investigates how the complexity of solving constraint problems varies with the types of constraints which are allowed, and considers some alternative approaches, including a constructive approach that builds new tractable constraint languages by combining simpler languages.
Algorithms and Complexity
Bogdan Grechuk
- 01 Jan 2021
TL;DR: A collection of theorems in algorithms and complexity, proved in the twenty-first century, which are at the same time great and easy to understand can be found in this paper.
131
A uniform approach to define complexity classes
TL;DR: A uniform family of computation models which encompasses most of the complexity classes of interest is introduced and a sufficient and necessary condition for proving separations of relativized complexity classes is given.
131
References
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
13.6K
The complexity of theorem-proving procedures
Stephen A. Cook
- 03 May 1971
TL;DR: 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 tautology.
7.4K
Word problems requiring exponential time(Preliminary Report)
L. J. Stockmeyer,A. R. Meyer +1 more
- 30 Apr 1973
TL;DR: 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.
Every Prime Has a Succinct Certificate
TL;DR: 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 $.
327
Comparison of polynomial-time reducibilities
Richard E. Ladner,Nancy Lynch,Alan L. Selman +2 more
- 30 Apr 1974
TL;DR: 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.
211