ConceptTheory & Algos
#P-completeness
A problem is P-complete if it is in P and every problem in P can be reduced to it via log-space reductions.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Ryan O'Donnell
Lectures that assume it
1Connections
7The lectures that define it or assume it, and the concepts next to it.