Skip to content
EntityQ1155722· pop 10· linked from 95 articles

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.

Wikidata facts

Subclass of
complexity class
Sources (2)

via Wikidata · CC0

Available in 10 languages

via Wikidata sitelinks · CC0