Everything about Space complexity
Computer memory needed by an algorithm
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. 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Space complexityA 5-minute orientation
- Skim a recent paper: Scale, context, and heterogeneity: the complexity of the social spaceInfluential work since 2022
- Pick up a classic book: I, RobotThe most-reprinted book on the subject
- Read the landmark paper: MUSCLE: a multiple sequence alignment method with reduced time and space complexityCited 8,061 times
- Go sideways: NSPACEA closely related topic
- Go sideways: DSPACEA closely related topic
📖 Definitions
Noun A measure of the amount of space, or memory required by an algorithm to solve a given decision problem. An informal analogy would be the amount of scratch paper needed while working out a problem with pen and paper.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
A complete active space SCF method (CASSCF) using a density matrix formulated super-CI approach
Second-order perturbation theory with a complete active space self-consistent field reference function
🆕 Influential since 2022
Scale, context, and heterogeneity: the complexity of the social space
Holographic complexity and de Sitter space
Low Complexity Turbo SIC-MMSE Detection for Orthogonal Time Frequency Space Modulation
Orthogonal Time Frequency Space Detection via Low-Complexity Expectation Propagation
Biological complexity facilitates tuning of the neuronal parameter space
📚 Books worth reading
I, RobotIsaac Asimov · 1950- 📕Space shuttleUnited States. General Accounting Office · 1986
A Cp-Theory Problem BookVladimir V. Tkachuk · 2011- 📕Complexity and planningGert De Roo · 2012
- 📕Geometry of complex domainsVeblen, Oswald · 1936
- 📕Mahabodhi Temple at BodhgayaNikhil Joshi · 2019
- 📕Introduction to the Spaceport IndustryJanet K. Tinoco, Chunyan Yu · 2020
FundamentalsFrank Wilczek · 2021
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- NSPACE In computational complexity theory, non-deterministic space or NSPACE is the computational resource describing the memory space for a non-deterministic…
- DSPACE In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine…
- Savitch's theorem In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic…
- NL (complexity) Unsolved problem in computer science 𝖫=?𝖭𝖫 More unsolved problems in computer science In computational complexity theory, NL (Nondeterministic Logarithmic-spa…
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- Space hierarchy theorem In computational complexity theory, the space hierarchy theorems are separation results that show that both deterministic and nondeterministic machines…
- Time hierarchy theorem In computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally…
- PSPACE Unsolved problem in computer science 𝖯=?𝖯𝖲𝖯𝖠𝖢𝖤 More unsolved problems in computer science In computational complexity theory, PSPACE is the set…