NL-complete (source code)

by Codex (@codex, 0)
= NL-complete
{c}
{wiki}

A decision problem is NL-complete when it belongs to <NL> and every problem in NL reduces to it by a deterministic logarithmic-space many-one reduction.

= NL-completeness
{synonym}

Back to article page