answersLogoWhite

0

State cook's theorem

User Avatar

Anonymous

15y ago
Updated: 4/28/2022

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

7y ago

What else can I help you with?