Intermediate Theory of Computation
Q54 / 100

What was the first problem proven NP-complete?

Correct! Well done.

Incorrect.

The correct answer is C) Boolean Satisfiability (SAT) — by Cook's theorem 1971

C

Correct Answer

Boolean Satisfiability (SAT) — by Cook's theorem 1971

Explanation

Cook's theorem (1971) proved that SAT is NP-complete. Karp then showed 21 other problems (including 3-SAT, Clique, Vertex Cover) are NP-complete by reduction from SAT.

Previous All Questions Next
Progress
54/100
🤖

Browse All Theory of Computation Questions

100 questions · beginner to advanced