## Computer-Aided Reasoning

- Matt Kaufmann, Panagiotis Manolios, J. Strother Moore
- Advances in Formal Methods
- 2000

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)

### Presentations referencing similar topics