The status of the P versus NP problem

  title={The status of the P versus NP problem},
  author={Lance Fortnow},
  journal={Commun. ACM},
  • L. Fortnow
  • Published 1 September 2009
  • Computer Science
  • Commun. ACM
It's one of the fundamental mathematical problems of our time, and its importance grows with the rise of powerful computers. 
Mathematics in the age of the Turing machine
  • T. Hales
  • Computer Science
    Turing's Legacy
  • 2014
The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs, as well as some examples from the literature.
Inductive Complexity of P versus NP Problem - Extended Abstract
An upper bound on the inductive complexity of second order of the P versus NP problem is determined using the complexity measure developed in [7,3,4] and the extensions obtained by using inductive register machines of various orders in [1,2].
A Simple Proof of P versus NP
P versus NP is one of the most important and unsolved problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? Another major complexity class is
QP versus NP
It is proved that maximum exclusive-or 2-satisfiability is in QP, and it is demonstrated this problem is NP-complete.
An Interesting Perspective to the P versus NP Problem
We discuss the P versus NP problem from the perspective of addition operation about polynomial functions. Two contradictory propositions for the addition operation are presented. With the proposition
On the P VS NP Question: A New Proof of Inequality
  • A. Meo
  • Computer Science, Mathematics
  • 2021
It is proved that the cost of the minimal implementation of core function increases with n exponentially, which is equivalent to proving that P and NP do not coincide.
The complexity of class polyL
Since every language in polyL is in QP, then every problem in NP can be decided in a quasi-polynomial time.
The P = Sharp-P Consequence
It is proved if Sharp-P = P, then it can be determined in polynomial time which subsets could be solved in a feasible polynometric time from every EXP language.
Quadratic Congruences on Average Case
The Quadratic Congruences is a known NP-complete problem and it is shown this problem can be solved in polynomial time for the average case.
On Average Case
There is an NP-complete problem that can be solved in polynomial time for the average case and the concept of NP-completeness has been very useful.


Parity, circuits, and the polynomial-time hierarchy
A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function and connections are given to the theory of programmable logic arrays and to the relativization of the polynomial-time hierarchy.
Parameterized Complexity
An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability, and introduces readers to new classes of algorithms which may be analysed more precisely than was the case until now.
A Fast Monte-Carlo Test for Primality
A uniform distribution a from a uniform distribution on the set 1, 2, 3, 4, 5 is a random number and if a and n are relatively prime, compute the residue varepsilon.
The Intractability of Resolution
The complexity of theorem-proving procedures
  • S. Cook
  • Mathematics, Computer Science
  • 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
Probabilistically checkable proofs
Can a proof be checked without reading it?
Reducibility among combinatorial problems" in complexity of computer computations
In his 1972 paper, Reducibility Among Combinatorial Problems, Richard Karp used Stephen Cooks 1971 theorem that the boolean satisfiability problem is.
Computational Complexity
  • S. Vadhan
  • Computer Science, Mathematics
    Encyclopedia of Cryptography and Security
  • 2005
Computational complexity theory provides a foundation for most of modern cryptography, where the aim is to design cryptosystems that are “easy to use” but “hard to break”.
A personal view of average-case complexity
  • R. Impagliazzo
  • Computer Science, Mathematics
    Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
  • 1995
The paper attempts to summarize the state of knowledge in this area, including some "folklore" results that have not explicitly appeared in print, and tries to standardize and unify definitions.
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
The notion of a partially stable point in a reductive-group representation is introduced, which generalizes the notion of stability in geometric invariant theory due to Mumford and reduces fundamental lower bound problems in complexity theory to problems concerning infinitesimal neighborhoods of the orbits of partially stable points.