Questions about space resources of computations in computational complexity or algorithms.
Studies on the space resources of computations are within the scope of space-bounded complexity. Complexity classes like logspace L and NL are central to studies in space-bounded computations, while other restrictions like polynomial space are also important.
complexity-classes is more suitable if the question is about the relationship between a space-bounded class and other classes.
|
created |
14 years ago by Jeremy Hurwitz |
|
viewed |
26 times |
|
active |
8 years, 4 months ago |
|
editors |
2 |
