Hacker Courses The online courses programmers keep recommending, ranked from 20 years of public forum comments.
i
#747 overall

6.890 Algorithms for Hard Problems

MIT OpenCourseWare

1 recommender · 1 thread · recommended in 1 year, 2022 · score 0.7

Search for it ↗

A graduate-level MIT course on algorithms for computationally hard problems, covering approaches to NP-hard and other intractable problems. Lecture notes are openly available on the instructor's course page.

A commenter calls it an excellent course taught by Virginia Williams and notes that the lecture notes are open.

Algorithms & Data Structuresadvancedfreevideo lectures#np-hard#complexity#approximation algorithms#williams

Recommendations by year

20062026

What commenters said (1)

  1. Recommendswhymauri2022in “The FBHHRBNRSSSHK-Algorithm for Multiplication is still not the end”

    Virginia Williams teaches an excellent course:

    https://people.csail.mit.edu/virgi/6.890/

    Lecture notes are open.

Related courses

Keyboard

In the course grid
←↑→↓
Move between courses
Home End
Start / end of row (with Ctrl: first / last)
PgUp PgDn
Jump several rows
Enter
Open course
S
Save / unsave course
1–5
Best, Trending, Hidden gems, Evergreen, Saved
[ ]
Previous / next topic
On a course page
← →
Previous / next course in your list
S
Save / unsave
O
Open the course website
Esc
Back to the grid
Everywhere
/
Search
T
Light / dark theme
?
This help