Explore relationships

Cook's theorem

In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete.

Use + to expand a branch. Click a topic name to open its summary.