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.
Links
Complexity Theory, Part II
Monday June 3