OurBigBook About$ Donate
 Sign in+ Sign up
by Ciro Santilli (@cirosantilli, 37)

P versus NP problem (P vs NP)

 ... Complexity class ELEMENTARY (complexity) EXPTIME PSPACE NP (complexity) NP-complete
 1 By others on same topic  0 Discussions  Updated 2025-05-26  +Created 1970-01-01  See my version
Interesting because of the Cook-Levin theorem: if only a single NP-complete problem were in P, then all NP-complete problems would also be P!
We all know the answer for this: either false or independent.
  • Table of contents
    • Ladner's Theorem P versus NP problem

Ladner's Theorem

 0  0 
P versus NP problem

 Ancestors (13)

  1. NP-complete
  2. NP (complexity)
  3. PSPACE
  4. EXPTIME
  5. ELEMENTARY (complexity)
  6. Complexity class
  7. Computational problem
  8. Computer science
  9. Computer
  10. Information technology
  11. Area of technology
  12. Technology
  13.  Home

 Incoming links (3)

  • BQP
  • Computer science
  • Millennium Prize Problems

 Synonyms (1)

  • cirosantilli/p-vs-np

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

P versus NP problem by Wikipedia Bot 0  1970-01-01
 Read the full article
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook