NSPACE
Sign in to saveIn computational complexity theory, non-deterministic space or NSPACE is the computational resource describing the memory space for a non-deterministic Turing machine. It is the non-deterministic counterpart of DSPACE.
~3 min read
Encyclopedic overview
7 sectionsContents
- Complexity classes
- Relation with other complexity classes
- DSPACE
- Time
- Limitations
- References
- External links
In computational complexity theory, non-deterministic space or NSPACE is the computational resource describing the memory space for a non-deterministic Turing machine. It is the non-deterministic counterpart of DSPACE.
==Complexity classes==
Excerpted from Wikipedia’s “NSPACE” article, available under the CC BY-SA 4.0 licence.