Everything about NSPACE

🧭 Start here: a 6-step reading path

1. Read the overview: NSPACEA 5-minute orientation
2. Pick up a classic book: N-SpaceThe most-reprinted book on the subject
3. Read the landmark paper: nSpace and GeoTime: A VAST 2006 Case StudyCited 11 times
4. Go sideways: DSPACEA closely related topic
5. Go sideways: Space complexityA closely related topic

🏆 Landmark papers (most cited)

• nSpace and GeoTime: A VAST 2006 Case Study

  Pascale Proulx, Lynn Chien, Robert Harper · 2007 · IEEE Computer Graphics and Applications · 11 citations

• Separation with the Ruzzo, Simon, and Tompa relativization implies Dspace(log n) ≠ Nspace(log n)

  Bernd Kirsig, Klaus-Jörn Lange · 1987 · Information Processing Letters · 11 citations

• A note on NSPACE ($\log _2 n$) and substitution

  S. A. Greibach · 1977 · RAIRO. Informatique théorique · 1 citations

• DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization

  Manindra Agrawal · 1997 · Journal of Computer and System Sciences · 1 citations

📚 Books worth reading

• N-SpaceLarry Niven · 1990
• 📕Isoclinic n-planes in Euclidean 2n-space, Clifford parallels in elliptic (2n-1)-space, and the Hurwitz matrix equationsYung-chow Wong · 1961
• 📕NSpaceDovin Melhee · 2009
• Doctor WhoEdward J Mason · 2001
• 📕The integro-geometric tangent measures of euclidean n-spaceJack Solomon Zelver · 1970
• 📕ghosts of N-spaceBarry Letts · 1995
• 📕N-Space
• N-SpaceChris Martin · 2011

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• DSPACE In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine…
• 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…
• Space hierarchy theorem In computational complexity theory, the space hierarchy theorems are separation results that show that both deterministic and nondeterministic machines…
• Structural complexity theory In computational complexity theory of computer science, the structural complexity theory or simply structural complexity is the study of complexity classes…
• NL (complexity) Unsolved problem in computer science ⁠𝖫=?𝖭𝖫⁠ More unsolved problems in computer science In computational complexity theory, NL (Nondeterministic Logarithmic-spa…
• Savitch's theorem In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic…
• Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
• DTIME In computational complexity theory, DTIME (or TIME) is the computational resource of computation time for a deterministic Turing machine. It represents…