A Mechanical Proof of the Cook-Levin Theorem


As is the case with many theorems in complexity theory, typical proofs of the celebrated Cook-Levin theorem showing the NPcompleteness of satisfiability are based on a clever construction. The Cook-Levin theorem is proved by carefully translating a possible computation of a Turing machine into a boolean expression. As the boolean expression is built, it is… (More)
DOI: 10.1007/978-3-540-30142-4_8


  • Presentations referencing similar topics