Computer science Computational complexity: resources and classes Concept
Space complexity
Summary
The space complexity of an algorithm is the amount of memory it needs, as a function of the length of its input. In the Turing machine model it counts the work-tape cells that the machine uses. Space is, with time complexity, one of the two main resources of complexity theory. Bounds on space define classes such as L, NL and PSPACE.
Where this leads
7 pages build on this one.
Further reading
About this page
| Tag | FDNFGKEEJR |
|---|---|
| URI | m2://FDNFGKEEJR |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68Q15, 68Q04 |
| 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.