Mathematical logic seminar - January 29, 2003
Zeev Nehari Visiting Assistant Professor
Department of Mathematical Sciences
Carnegie Mellon University
Some basic computational complexity
An introduction to some concepts from computational complexity: complexity classes, the P versus NP problem, leading up to probabilistically checkable proofs.