Sign inSign in

NL-completeness

A language is NL-complete if it is in NL and every language in NL is log-space reducible to it.
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

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A language BB is NL\text{NL}-complete if BB is in NL\text{NL} and every language AA in NL\text{NL} reduces to BB under a suitable reduction.
    • 37:21NL-Completeness and Logspace Reductions

Connections

7

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

Concepts5

Lectures2

2 lecturers. 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.