His seminal paper, The Complexity of Theorem Proving Procedures, presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-Completeness.
Njegov plodonosni članak, The Complexity of Theorem Proving Procedures, predstavljen 1971. na ACM SIGACT simpoziju o teorijskom računarstvu, je postavio temelje za teoriju NP-potpunosti.