answersLogoWhite

0

State cook's theorem

Updated: 4/28/2022
User Avatar

Wiki User

14y ago

Best Answer

In computational complexity theory, Cook's theorem, also known as the Cook–Levin theorem, states that the Boolean satisfiability problem is NP-complete. That is, any problem in NP can be reduced in polynomial time by a deterministic Turing machine to the problem of determining whether a Boolean formula is satisfiable.

User Avatar

Wiki User

6y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: State cook's theorem
Write your answer...
Submit
Still have questions?
magnify glass
imp