Algorithmic Lower Bounds: Fun with Hardness Proofs
This is an advanced class on algorithmic reduction, focusing on techniques for proving problems are complete with respect to various complexity classes.
Also Available on
Share & Embed
Available episodes
0
All content for Algorithmic Lower Bounds: Fun with Hardness Proofs is the property of MIT 6.890, Fall 2014 and is served directly from their servers with no modification, redirects, or rehosting. The podcast is not affiliated with or endorsed by Podbay in any way.