Sign inSign in

Log-space reducibility

A language A is log-space reducible to B if there is a reduction function computable in log space by a transducer that maps instances of A to instances of B.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Connections

    5

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

    Concepts4

    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.