Computability and Complexity
Computability and Complexity - Overview
- Introduction to Computability and Complexity
- Existence of unsolvable problems
- The Halting Problem
- Computational Complexity Theory
- NP and NP-completeness
- Cook's Theorem
All of the above
Postscript version of OHP slides (complete) (8 to page)
Postscript Version of Proof of Cook's Theorem (8 to page OHP)
See also:
Algorithm Design Paradigms
PED Home Page