Computer science Computational complexity: resources and classes Concept
L
Summary
L is the complexity class of decision problems that a deterministic Turing machine can solve with logarithmic space. The machine reads its input freely but may only write a fixed number of counters or pointers into the input. L lies inside P, and it is the smallest of the standard space classes. It is also called LOGSPACE.
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | VRZ9H4EZ6V |
|---|---|
| URI | m2://VRZ9H4EZ6V |
| 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.