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
Article
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==
Connections
computational resource
Entity
International Standard Book Number
Entity
algorithm
Entity
Turing machine
Entity
computational complexity theory
Entity
NP-complete
Entity
NP
Entity
decision problem
Entity
P
Entity
regular language
Entity
complexity class
Entity
NP-hard
Entity
non-deterministic Turing machine
Entity
PSPACE
Entity
NL
Entity
context-sensitive language
Entity
co-NP
Entity
EXPTIME
Entity
L
Entity
BPP
Entity