Clifford Smyth
Zeev Nehari Visiting Assistant Professor
Department of Mathematical Sciences
Carnegie Mellon University

Title:

Some basic computational complexity

Abstract:

An introduction to some concepts from computational complexity: complexity
classes, the P versus NP problem, leading up to probabilistically checkable
proofs.