Cook's Theorem
Cook's Theorem states that any problem in class NP can be reduced
to an instance of SAT in polynomial time.
Cook.ps is all the slides from the presentation,
or you can browse the following:
Cook_01.jpg.html
Cook_02a.jpg.html
Cook_02.jpg.html
Cook_03.jpg.html
Cook_04.jpg.html
Cook_05.jpg.html
Cook_06.jpg.html
Cook_07.jpg.html
Cook_08.jpg.html
Cook_09.jpg.html
Cook_10.jpg.html
Cook_11.jpg.html