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

Still curious? Ask our experts.

Chat with our AI personalities

DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin
BeauBeau
You're doing better than you think!
Chat with Beau
RossRoss
Every question is just a happy little opportunity.
Chat with Ross

Add your answer:

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