Archive for the ‘Computational Complexity’ Category

Sipser on P versus NP

December 22, 2012

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.


Follow

Get every new post delivered to your Inbox.

Join 77 other followers