NL
Description: NL is a computational complexity class comprising decision problems solvable by a nondeterministic Turing machine using logarithmic space.
Primary topic: Complexity and Algorithms in Graphs (37%)
Wikidata ID: wiki/Q12857599
OpenAlex ID: keywords/nl
