ConceptTheory & Algos
Deterministic polynomial time checkability
The property that a condition can be verified by a deterministic algorithm running in time polynomial in the input size.
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.
Deterministic polynomial time1Verification1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.