ConceptTheory & Algos
Time constructible
A function is time constructible if it is at least n log n and given a string of length n, its base two representation can be computed in time order t(n).
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
4The lectures that define it or assume it, and the concepts next to it.