Algorithmic Lower Bounds: Fun with Hardness Proofs (MIT 6.890) - Video lectures 2014
Erik Demaine

@article{,
title= {Algorithmic Lower Bounds: Fun with Hardness Proofs (MIT 6.890) - Video lectures 2014},
journal= {},
author= {Erik Demaine},
year= {2014},
url= {https://ocw.mit.edu/6-890F14},
abstract= {"Algorithmic Lower Bounds: Fun with Hardness Proofs" is a class taking a practical approach to proving problems can’t be solved efficiently (in polynomial time and assuming standard complexity-theoretic assumptions like P ≠ NP). The class focuses on reductions and techniques for proving problems are computationally hard for a variety of complexity classes. Along the way, the class will create many interesting gadgets, learn many hardness proof styles, explore the connection between games and computation, survey several important problems and complexity classes, and crush hopes and dreams (for fast optimal solutions).

Main course URL: https://ocw.mit.edu/6-890F14

This content hosted at the Internet Archive at https://archive.org/details/MIT6.890F14
Files may have changed, which prevents torrents from downloading correctly or completely; please check for an updated torrent at https://archive.org/download/MIT6.890F14/MIT6.890F14_archive.torrent
Note: retrieval usually requires a client that supports webseeding (GetRight style).
Note: many Internet Archive torrents contain a 'pad file' directory. This directory and the files within it may be erased once retrieval completes.
Note: the file MIT6.890F14_meta.xml contains metadata about this torrent's contents.},
keywords= {computer engineering,Programming,algorithms,computer science},
terms= {https://ocw.mit.edu/terms},
license= {http://creativecommons.org/licenses/by-nc-sa/3.0/},
superseded= {}
}