ConceptTheory & Algos
coNP-complete
A problem is coNP-complete if it is in coNP and every other coNP problem is polynomial-time reducible to it.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
2Each in their own terms, from the easiest level.
Ryan O'Donnell
A language L is coNP-complete if L is in coNP and every language in coNP reduces to L in polynomial time.
Connections
4The lectures that define it or assume it, and the concepts next to it.