"The Complexity of Theorem-Proving Procedures"
E321037
UNEXPLORED
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.