OpenKnowledge

Home Paths Roadmap Studio My data

Catalog · Algorithmic Lower Bounds: Fun with Hardness Proofs

Lecture 11 of 23

Lecture 11: Inapproximability Examples

← Previous Lecture 10: Inapproximabililty Overview Next → Lecture 12: Gaps and PCP

Materials

Transcript (PDF) ↗ transcript

Sources

MIT OpenCourseWare

Browse

Catalog
Search
Roadmap
New courses (Atom)

OpenKnowledge — a catalog of open courseware. Lectures are embedded from their sources; each course carries its original license.