ConceptTheory & Algos
Composition of log-space computable functions
The theorem states that if functions and are computable in space, then their composition (P ∘ Q)(x) = Q(P(x)) is also computable in space.
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.
Function composition1Log-space complexity1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.