DSPACE
Sign in to saveIn computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine. It represents the total amount of memory space that a "normal" physical computer would need to solve a given computational problem with a given algorithm.
~5 min read
Article
6 sectionsContents
- Complexity classes
- Machine models
- Hierarchy theorem
- Relation with other complexity classes
- References
- External links
In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing machine. It represents the total amount of memory space that a "normal" physical computer would need to solve a given computational problem with a given algorithm.
==Complexity classes==
Connections
Turing machine
Entity
computational resource
Entity
constructible function
Entity
International Standard Book Number
Entity
algorithm
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
Cambridge University Press
Entity
pigeonhole principle
Entity
big O notation
Entity
computational complexity theory
Entity
Springer Science+Business Media
Entity
NP
Entity
NP-complete
Entity
decision problem
Entity
time complexity
Entity
John Edward Hopcroft
Entity
Handle System
Entity
P
Entity
regular language
Entity