KnowraP versus NP problemLinked fromLinked fromThe 27 pages that link to P versus NP problem, each with the reason it gives.All 27Broader topic 5Related 18Narrower topic 1Compared with 3Gödel's incompleteness theoremsRelated: Many logicians suspect proof complexity and relativization barriers relate to incompleteness.NP-completenessRelated: A polynomial-time algorithm for any NP-complete problem would imply P equals NP.Randomized algorithmRelated: Randomized complexity classes offer related, unresolved questions about probabilistic computation.Time complexityRelated: It asks whether a broad class of problems has polynomial-time algorithms.Boolean satisfiability problemRelated: A polynomial-time SAT algorithm would imply P equals NP.Polynomial-time reductionRelated: Reductions relate the difficulty of individual problems to this central complexity question.Cook–Levin theoremRelated: The theorem implies that a polynomial-time algorithm for satisfiability would solve every problem in NP efficiently.Perfect matchingRelated: Perfect matching is efficiently solvable, unlike many closely related matching-counting questions.Polynomial timeRelated: It asks whether polynomial time captures all efficiently verifiable problems.Stephen CookRelated: Cook’s work supplied the first concrete foundation for studying this central unresolved question.AKS primality testRelated: AKS gives primality a polynomial-time algorithm without resolving this broader complexity question.Matrix theoryRelated: Computational complexity frames the unresolved limits of exact matrix algorithms.Nondeterministic Turing machineRelated: It asks whether nondeterministic polynomial-time computation can be simulated efficiently by deterministic computation.Graph isomorphism problemRelated: Graph isomorphism is not known to resolve this broader question either way.Ellipsoid methodRelated: The linear-programming result sharpened understanding of polynomial-time computation without resolving this broader question.Gödel's first incompleteness theoremRelated: A concrete statement whose independence from standard axioms remains a live possibility.Hartmanis–Stearns conjectureRelated: This is the conjecture's standard name and the precise unresolved question.Model of computationRelated: Its answer concerns the power of efficient computation across standard models.
KnowraP versus NP problemLinked fromLinked fromThe 27 pages that link to P versus NP problem, each with the reason it gives.All 27Broader topic 5Related 18Narrower topic 1Compared with 3Gödel's incompleteness theoremsRelated: Many logicians suspect proof complexity and relativization barriers relate to incompleteness.NP-completenessRelated: A polynomial-time algorithm for any NP-complete problem would imply P equals NP.Randomized algorithmRelated: Randomized complexity classes offer related, unresolved questions about probabilistic computation.Time complexityRelated: It asks whether a broad class of problems has polynomial-time algorithms.Boolean satisfiability problemRelated: A polynomial-time SAT algorithm would imply P equals NP.Polynomial-time reductionRelated: Reductions relate the difficulty of individual problems to this central complexity question.Cook–Levin theoremRelated: The theorem implies that a polynomial-time algorithm for satisfiability would solve every problem in NP efficiently.Perfect matchingRelated: Perfect matching is efficiently solvable, unlike many closely related matching-counting questions.Polynomial timeRelated: It asks whether polynomial time captures all efficiently verifiable problems.Stephen CookRelated: Cook’s work supplied the first concrete foundation for studying this central unresolved question.AKS primality testRelated: AKS gives primality a polynomial-time algorithm without resolving this broader complexity question.Matrix theoryRelated: Computational complexity frames the unresolved limits of exact matrix algorithms.Nondeterministic Turing machineRelated: It asks whether nondeterministic polynomial-time computation can be simulated efficiently by deterministic computation.Graph isomorphism problemRelated: Graph isomorphism is not known to resolve this broader question either way.Ellipsoid methodRelated: The linear-programming result sharpened understanding of polynomial-time computation without resolving this broader question.Gödel's first incompleteness theoremRelated: A concrete statement whose independence from standard axioms remains a live possibility.Hartmanis–Stearns conjectureRelated: This is the conjecture's standard name and the precise unresolved question.Model of computationRelated: Its answer concerns the power of efficient computation across standard models.