ConceptTheory & Algos
Complexity class TIME(t(n)) / a(n)
The class of languages decided by a Turing machine running in time that has access to an advice string of length depending only on the input length.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.