Cook–Levin theorem
Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete. That is, it is in NP, and any problem in NP can be reduced in polynomial time by a deterministic Turing machine to the Boolean satisfiability problem.
Nº Q377276 ★
Common · Knowledge
Cook–Levin theorem
Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete. That is, it is in NP, and any problem in NP can be reduced in polynomial time by a deterministic Turing machine to the Boolean satisfiability problem.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete. That is, it is in NP, and any problem in NP can be reduced in polynomial time by a deterministic Turing machine to the Boolean satisfiability problem. The theorem is named after Stephen Cook and Leonid Levin. The proof is due to Richard Karp, based on an earlier proof (using a different notion of reducibility) by Cook. An important consequence of this theorem is that if there exists a deterministic polynomial-time algorithm for solving Boolean satisfiability, then every NP problem can be solved by a deterministic polynomial-time algorithm. The question of whether such an algorithm for Boolean satisfiability exists is thus equivalent to the P versus NP problem, which is still widely considered the most important unsolved problem in theoretical computer science.
Text: Wikipédia, CC BY-SA 4.0. · Image: me (CC BY-SA 3.0) ·
Related cards
Stephen Cook
American-Canadian computer scientist
Nº Q62870 ★
NP (complexity)
Computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time
Nº Q628036 ★★★
Boolean satisfiability problem
Problem of determining if a Boolean formula could be made true
Nº Q875276 ★★
PCP theorem
Theorem in complexity theory that every problem in NP has probabilistically checkable proofs
Nº Q1140200 ★
NP-completeness
Complexity class
Nº Q215206 ★★★
No free lunch theorem
The theorem that, if a machine-learning algorithm does well on some problems, then it pays for that on all other problems
Nº Q7045226 ★★