MIT 6006 Fall 2011 Lecture 23
>> YOUR LINK HERE: ___ http://youtube.com/watch?v=9S4STigO2DY
Computational complexity: complexity classes (polynomial, exponential, solvable in finite time); decision problems; solvable problems; non-deterministic-polynomial problems; reductions; the NP-complete class of problems • 6.006 on OCW: http://ocw2.mit.edu/courses/electrica...
#############################
