Even though we don't know whether $\plangs = \nplangs$, we have a hunch of which problems in $\nplangs$ might not be solvable in polynomial time. Those are the $\nplangs$-complete problems, the focus of today's lecture.
File Attachments
Lecture Recording
The complete archive of this quarter's lecture recordings is available on Canvas.
Today's recording will be embedded on this page shortly after lecture.