ConceptTheory & Algos
Complexity class TIME
A complexity class based on running time, defined as the set of all languages decided by a one-tape Turing machine in order of t(n) time.
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.