Which computer scientist published the 1971 paper "The complexity of theorem-proving procedures," proving that the Boolean satisfiability problem is NP-complete?
Show answer
Stephen Cook
The Cook-Levin theorem, published in 1971, was the first to identify a problem as NP-complete. This provided a foundation for the theory of computational complexity and the P vs NP problem.
Also asked as:
- Who proved the Boolean satisfiability problem is NP-complete in the 1971 paper "The complexity of theorem-proving procedures"?