DSPACE
|
|
In computational complexity theory, DSPACE or SPACE is a complexity class describing the resource of memory space for a deterministic Turing machine. For each function f(n), there is a complexity class SPACE(f(n)), the set of decision problems which can be solved by a deterministic Turing machine using space O(f(n)), and unlimited time. DSPACE is the deterministic counterpart of NSPACE.
The complexity class PSPACE can be defined in terms of DSPACE as follows:
- <math>\mbox{PSPACE} = \bigcup_{k\in\mathbb{N}} \mbox{DSPACE}(n^k)<math>
In the world of Digital Libraries, DSpace (http://www.dspace.org/) is an open source software package which provides the tools for management of digital assets and is commonly used as the basis for an Institutional repository Template:Compu-sci-stub