ConceptTheory & Algos
Sharp P
The class of function problems that count the number of accepting paths of a polynomial-time non-deterministic Turing machine.
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
1Lectures that assume it
1Connections
6The lectures that define it or assume it, and the concepts next to it.