Browse Course Material

  • Syllabus

  • Calendar

  • Instructor Insights

    • Video Playlist
  • Lecture Videos

  • Lecture Notes

  • Assignments

  • Projects

Course Info
Instructor
  • Prof. Erik Demaine
Departments
  • Electrical Engineering and Computer Science
As Taught In
Fall 2014
Level
Graduate
Topics
  • Engineering
    Computer Science
    Algorithms and Data Structures
    Theory of Computation
  • Mathematics
    Computation
Learning Resource Types
theaters Lecture Videos
assignment_turned_in Problem Sets with Solutions
notes Lecture Notes
group_work Projects
co_present Instructor Insights

Download Course
MIT OpenCourseWare MIT OpenCourseWare
  • search
  • Give Now
  • About OCW
  • Help & Faqs
  • Contact Us
MIT OpenCourseWare MIT OpenCourseWare
search give now about ocw help & faqs contact us
6.890 | Fall 2014 | Graduate
Algorithmic Lower Bounds: Fun with Hardness Proofs
  • Syllabus

  • Calendar

  • Instructor Insights

    • Video Playlist
  • Lecture Videos

  • Lecture Notes

  • Assignments

  • Projects

Lecture Videos

The lecture videos are also available an integrated format (synced notes, slides, and video) on Prof. Demaine’s website for 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs.

Lecture 1: Overview
Lecture 2: 3-Partition I
Lecture 3: 3-Partition II
Lecture 4: SAT I
Lecture 5: SAT Reductions
Lecture 6: Circuit SAT
Lecture 7: Planar SAT
Lecture 8: Hamiltonicity
Lecture 9: Graph Problems
Lecture 10: Inapproximabililty Overview
Lecture 11: Inapproximability Examples
Lecture 12: Gaps and PCP
Lecture 13: W Hierarchy
Lecture 14: ETH and Planar FPT
Lecture 15: #P and ASP
Lecture 16: NP and PSPACE Video Games
Lecture 17: Nondeterministic Constraint Logic
Lecture 18: 0- and 2-Player Games
Lecture 19: Unbounded Games
Lecture 20: Undecidable and P-Complete
Lecture 21: 3SUM and APSP Hardness
Lecture 22: PPAD
Lecture 23: PPAD Reductions
Course Info
Instructor
  • Prof. Erik Demaine
Departments
  • Electrical Engineering and Computer Science
As Taught In
Fall 2014
Level
Graduate
Topics
  • Engineering
    Computer Science
    Algorithms and Data Structures
    Theory of Computation
  • Mathematics
    Computation
Learning Resource Types
theaters Lecture Videos
assignment_turned_in Problem Sets with Solutions
notes Lecture Notes
group_work Projects
co_present Instructor Insights

Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
facebook
instagram
twitter
youtube
LinkedIn
© 2001–2023 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of: Open Education Global
facebook
instagram
twitter
youtube
LinkedIn
© 2001–2023 Massachusetts Institute of Technology