Sign inSign in

Composition of log-space computable functions

The theorem states that if functions PP and QQ are computable in O(log⁡n)O(\log n) space, then their composition (P ∘ Q)(x) = Q(P(x)) is also computable in O(log⁡n)O(\log n) space.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

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

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.