MIT OpenCourseWare

Browse materialsMIT 6.890 · Fall 2014

Algorithmic Lower Bounds: Fun with Hardness Proofs

Art: not stated, Fletcher's Combined Block Telegraph Apparatus and Bell, 1889 · Public domain

Instructor
Prof. Erik Demaine
Term
Fall 2014
Level
Graduate
What's inside
31 videos · 4 problem sets · 4 solutions · 1 lecture note · 77 other files · 6 web pages
Materials open
Videos here · files on MIT OCW
About this course

Source: MIT OpenCourseWare 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014, Prof. Erik Demaine — original course page on ocw.mit.edu ↗. License: CC BY-NC-SA 4.0. Study order: MIT's own listing order, section by section. Taken from MIT's published course files, downloaded from ocw.mit.edu on September 23, 2026. How RedLectern is built.

Materials are grouped the way MIT organized them. A verified, course-wide order has not been established here.

Has MIT solutions 4 files in this course are named by MIT as solutions.

Before you start

Prerequisites are not listed here. Check MIT's own syllabus for this course.

How this course was organized

What's here, and what isn't

  • MIT's own materials here did not support a verified, course-wide order, so they are grouped by section instead.

Not included here

38 items from the source could not be safely included:

  • MIT's page format for this item wasn't recognized clearly enough to place it safely. (37 items)
  • Referenced in a table, but without MIT's own verified order, so it isn't used to claim a sequence.

Materials by section

Grouped by section, as MIT organized them. Not sequenced or ordered.

Instructor Insights

8 videos in this section

Video Playlist

8 videos

Lecture Notes

46 files

Assignments

8 problem sets

Other materials from this course

31 video transcripts

2 images

MIT OpenCourseWare, Prof. Erik Demaine, 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014.

License: CC BY-NC-SA 4.0 · Edition: Fall 2014 · Open the original course on OCW ↗

Organized by RedLectern, independent of MIT and not endorsed by MIT.

Per-resource rights are recorded on each resource; All-Rights-Reserved items are link-only, never mirrored.