Space complexity
The space complexity of an algorithm or a data structure is the amount of memory space required to solve an instance of the computational problem as a function of characteristics of the input.
≈ 5 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
The space complexity of an algorithm or a data structure is the amount of memory space required to solve an instance of the computational problem as a function of characteristics of the input. It is the memory required by an algorithm until it executes completely.[1] This includes the memory space used by its inputs, called input space, and any other (auxiliary) memory it uses during execution, which is called auxiliary space.
Similar to time complexity, space complexity is often expressed asymptotically in big O notation, such as O(n), O(nlogn), O(nα), O(2n), etc., where n is a characteristic of the input influencing space complexity.
Space complexity classes
edit edit sourceAnalogously to time complexity classes DTIME(f(n)) and NTIME(f(n)), the complexity classes DSPACE(f(n)) and NSPACE(f(n)) are the sets of languages that are decidable by deterministic (respectively, non-deterministic) Turing machines that use O(f(n)) space. The complexity classes PSPACE and NPSPACE allow f to be any polynomial, analogously to P and NP. That is, 𝖯𝖲𝖯𝖠𝖢𝖤=⋃c∈ℤ+𝖣𝖲𝖯𝖠𝖢𝖤(nc) and 𝖭𝖯𝖲𝖯𝖠𝖢𝖤=⋃c∈ℤ+𝖭𝖲𝖯𝖠𝖢𝖤(nc)
Relationships between classes
edit edit sourceThe space hierarchy theorem states that, for all space-constructible functions f(n), there exists a problem that can be solved by a machine with f(n) memory space, but cannot be solved by a machine with asymptotically less than f(n) space.
The following containments between complexity classes hold.[2] 𝖣𝖳𝖨𝖬𝖤(f(n))⊆𝖣𝖲𝖯𝖠𝖢𝖤(f(n))⊆𝖭𝖲𝖯𝖠𝖢𝖤(f(n))⊆𝖣𝖳𝖨𝖬𝖤(2O(f(n)))
Furthermore, Savitch's theorem gives the reverse containment that if f∈Ω(log(n)), 𝖭𝖲𝖯𝖠𝖢𝖤(f(n))⊆𝖣𝖲𝖯𝖠𝖢𝖤((f(n))2).
As a direct corollary, 𝖯𝖲𝖯𝖠𝖢𝖤=𝖭𝖯𝖲𝖯𝖠𝖢𝖤. This result is surprising because it suggests that non-determinism can reduce the space necessary to solve a problem only by a small amount. In contrast, the exponential time hypothesis conjectures that for time complexity, there can be an exponential gap between deterministic and non-deterministic complexity.
The Immerman–Szelepcsényi theorem states that, again for f∈Ω(log(n)), 𝖭𝖲𝖯𝖠𝖢𝖤(f(n)) is closed under complementation. This shows another qualitative difference between time and space complexity classes, as nondeterministic time complexity classes are not believed to be closed under complementation; for instance, it is conjectured that NP ≠ co-NP.[3][4]
LOGSPACE
edit edit sourceL or LOGSPACE is the set of problems that can be solved by a deterministic Turing machine using only O(logn) memory space with regards to input size. Even a single counter that can index the entire n-bit input requires logn space, so LOGSPACE algorithms can maintain only a constant number of counters or other variables of similar bit complexity.
LOGSPACE and other sub-linear space complexity is useful when processing large data that cannot fit into a computer's RAM. They are related to Streaming algorithms, but only restrict how much memory can be used, while streaming algorithms have further constraints on how the input is fed into the algorithm. This class also sees use in the field of pseudorandomness and derandomization, where researchers consider the open problem of whether L = RL.[5][6]
The corresponding nondeterministic space complexity class is NL.
Auxiliary space complexity
edit edit sourceThe term auxiliary space refers to space other than that consumed by the input. Auxiliary space complexity could be formally defined in terms of a Turing machine with a separate input tape which cannot be written to, only read, and a conventional working tape which can be written to. The auxiliary space complexity is then defined (and analyzed) via the working tape. For example, consider the depth-first search of a balanced binary tree with n nodes: its auxiliary space complexity is Θ(logn).
See also
edit edit source- Analysis of algorithms – Study of resources used by an algorithm
- Computational complexity theory – Inherent difficulty of computational problems
- Computational resource – Aspect of computational complexity theory
- Time complexity – Estimate of time taken for running an algorithm
References
edit edit source- ^ Kuo, Way; Zuo, Ming J. (2003), Optimal Reliability Modeling: Principles and Applications, John Wiley & Sons, p. 62, ISBN 9780471275459 Wikipedia revision 1369634494, retrieved 2026-11-19
- ^ Arora, Sanjeev; Barak, Boaz (2007), Computational Complexity : A Modern Approach (PDF) (draft ed.), p. 76, ISBN 9780511804090 Wikipedia revision 1369634494, retrieved 2026-11-19
- ^ Immerman, Neil (1988), "Nondeterministic space is closed under complementation" (PDF), SIAM Journal on Computing, 17 (5): 935–938, doi:10.1137/0217058, MR 0961049 Wikipedia revision 1369634494, retrieved 2026-11-19
- ^ Szelepcsényi, Róbert (1987), "The method of forcing for nondeterministic automata", Bulletin of the EATCS, 33: 96–100 Wikipedia revision 1369634494, retrieved 2026-11-19
- ^ Nisan, Noam (1992), "RL ⊆ SC", Proceedings of the 24th ACM Symposium on Theory of computing (STOC '92), Victoria, British Columbia, Canada, pp. 619–623, doi:10.1145/129712.129772, ISBN 0-89791-511-9, S2CID 11651375
{{citation}}: CS1 maint: location missing publisher (link). Wikipedia revision 1369634494, retrieved 2026-11-19 - ^ Reingold, Omer; Trevisan, Luca; Vadhan, Salil (2006), "Pseudorandom walks on regular digraphs and the RL vs. L problem" (PDF), STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, New York: ACM, pp. 457–466, doi:10.1145/1132516.1132583, ISBN 1-59593-134-1, MR 2277171, S2CID 17360260 Wikipedia revision 1369634494, retrieved 2026-11-19
Text derived from https://en.wikipedia.org/w/index.php?oldid=1369634494 under CC BY-SA 4.0; modifications have been made.