OurBigBook About$ Donate
 Sign in Sign up

Cook-Levin theorem

Ciro Santilli (@cirosantilli, 37) ... Complexity class ELEMENTARY (complexity) EXPTIME PSPACE NP (complexity) NP-complete
Updated 2025-07-16  1 By others on same topic  0 Discussions Create my own version

 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 (1)

  • P versus NP problem

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Cook–Levin theorem by Wikipedia Bot 0
 View more
The Cook–Levin theorem, established by Stephen Cook in 1971 and independently by Leonid Levin, is a fundamental result in computational complexity theory. It states that the Boolean satisfiability problem (SAT) is NP-complete. This means that SAT is at least as hard as any problem in the complexity class NP (nondeterministic polynomial time), and any problem in NP can be reduced to SAT in polynomial time.
 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