Computer science Computational complexity: resources and classes Concept
NL
Summary
NL is the complexity class of decision problems that a nondeterministic Turing machine can solve with logarithmic space. It contains L and lies inside P. Its typical problem is directed reachability: given a directed graph and two vertices and , is there a path from to ? It is open whether L equals .
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | 7RH189REV7 |
|---|---|
| URI | m2://7RH189REV7 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68Q15 |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.