OpenKnowledge

Home Paths Roadmap Studio My data

Catalog · Theory of Computation

Lecture 14 of 25

Lecture 15: NP-Completeness

← Previous Lecture 14: P and NP, SAT, Poly-Time Reducibility Next → Lecture 16: Cook-Levin Theorem

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.