DSPACE

The term comes from the DSPACE complexity theory in theoretical computer science. It provides a general statement about which memory requirements claimed a calculation method on an idealized model of a computer. It can be so therefore the storage supplies for certain applications estimate.

For example, the storage requirement of a computational method in linear proportion increases with the length of the input value, it is said, the process belong to DSPACE ( n ). If the memory requirement grows exponentially with the length of the input value, then the method belongs to DSPACE (exp ( n)).

DSPACE ( f ) or short- SPACE ( f) stands for the amount of space complexity classes in terms of a deterministic Turing machine. If a concrete function f indicated, it means: DSPACE ( f) is the class of those decision problems that are solvable on a deterministic Turing machine with O ( f) space. Note that if you specify a concrete function f is the name DSPACE ( f) is a single complexity class while using an unspecified function f is the name DSPACE ( f) a whole lot of complexity classes says. Moreover, one can see from usually of constant factors in the function definition of f and is thus DSPACE (f) = DSPACE (O ( f)).

The spelling DSPACE (f) is particularly often used to define more concrete complexity classes: for example, the important class of PSPACE is defined as follows:

• Complexity class