Sipser on P versus NP
On October 3, 2006 Michael Sipser was at Harvard to give the following lecture on the P versus NP problem:
This talk is arguably the very best introduction to computational complexity I have ever come across. I highly recommend it.
Tags: Computational Complexity, Michael Sipser, P vs NP, Talks