NL-completeness
Description: A complexity-theoretic classification for problems that are complete for nondeterministic logarithmic space under an appropriate reduction.
Primary topic: semigroups and automata theory (42%)
OpenAlex ID: keywords/nl-completeness
