• Corpus ID: 5773521

The P versus NP Problem

@article{Cook2010ThePV,
  title={The P versus NP Problem},
  author={Stephen A. Cook},
  journal={ArXiv},
  year={2010},
  volume={abs/1001.3816}
}
  • S. Cook
  • Published 2010
  • Computer Science
  • ArXiv
The P versus NP problem is to determine whether every language accepted by some nondeterministic algorithm in polynomial time is also accepted by some (deterministic) algorithm in polynomial time. To define the problem precisely it is necessary to give a formal model of a computer. The standard computer model in computability theory is the Turing machine, introduced by Alan Turing in 1936 [37]. Although the model was introduced before physical computers were built, it nevertheless continues to… 
Logarithmic Space Verifiers on NP-complete
TLDR
There is an NP-complete language defined by a logarithmic space verifier M such that when the input is an element of the language with its certificate, then M outputs a string which belongs to a single language in P.
Diagonalization of Polynomial-Time Turing Machines Via Nondeterministic Turing Machine
TLDR
It is obtained that there is a language L d not accepted by any polynomial-time deterministic Turing machines but accepted by a nondeterministic Turing machine working within O ( n k ) for any k ∈ N 1 .
Diagonalization of Polynomial-Time Deterministic Turing Machines Via Nondeterministic Turing Machine
TLDR
It is obtained that there is a language L d not accepted by any polynomial-time deterministic Turing machines but accepted by a nondeterministic Turing machine working within O ( n k ) for any k ∈ N 1 .
Computability vs. Nondeterministic and P vs. NP
TLDR
New concepts: NP (nondeterministic problem) and NP-algorithm (defined as the optimal algorithm to get the best fit approximation value of NP) are brought forth and P versus NP is the relativity of Computability and Nondetergetic, P/=NP.
A non-canonical example to support P is not equal to NP
The more unambiguous statement of the P versus NP problem and the judgement of its hardness, are the key ways to find the full proof of the P versus NP problem. There are two sub-problems in the P
Logarithmic S pace V erifiers on NPC omplete
TLDR
There is an NP-complete language defined by a logarithmic space verifier M such that when the input is an element of the language with its certificate, then M outputs a tring which belongs to a single language in L.
A Simple Elementary Proof of P=NP based on the Relational Model of E. F. Codd
  • A. Li
  • Computer Science
    ArXiv
  • 2018
TLDR
The term "complete configuration" is unnecessary and harmful in computational complexity theory because of excessive symbol redundancy and a simple elementary proof of P=NP is obtained.
Separation of P and NP
TLDR
With a new proof method, already used in arXiv:2104.14316, P not equal NP can be proved.
The complexity of class TAUTOLOGY-NP
TLDR
There is a TAUTOLOGY-L language that is not only complete for TAUTology-NP, but it is also in P, and this is defined using the polynomial time reduction as well.
P versus NP
  • 2020
...
...

References

SHOWING 1-10 OF 70 REFERENCES
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
TLDR
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 $.
Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets
The Relative Efficiency of Propositional Proof Systems
TLDR
All standard Hilbert type systems and natural deduction systems are equivalent, up to application of a polynomial, as far as minimum proof length goes, and extended Frege systems are introduced, which allow introduction of abbreviations for formulas.
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
Lower bounds are established on the computational complexity of the decision problem and on the inherent lengths of proofs for two classical decidable theories of logic: the first-order theory of the
Generic oracles and oracle classes
  • M. Blum, R. Impagliazzo
  • Computer Science, Mathematics
    28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
In this paper, we examine various complexity issues relative to an oracle for a generic set in order to determine which are the more "natural" conjectures for these issues. Generic oracle results
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
TLDR
A pseudo-random generator which produces n instances of a problem for which the analog of the XOR lemma holds is given, and it is shown that if any problem in E = DTIAl E(2°t”j) has circuit complexity 2Q(”), then P = BPP.
The Complexity of Finite Functions
  • R. Boppana, M. Sipser
  • Computer Science
    Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
  • 1990
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
Bounded arithmetic, propositional logic, and complexity theory
  • J. Krajícek
  • Computer Science
    Encyclopedia of mathematics and its applications
  • 1995
This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author
...
...