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:

\mbox{PSPACE} = \bigcup_{k\in\mathbb{N}} \mbox{DSPACE}(n^k)

In the world of Digital Libraries, DSpace 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

<< Previous

Word Browser

Next >>

krypteria
datamation
biesbosch
japanology
pledge
asmp
anselm franz
agoge
central savannah river area
the desert sessions
st. elizabeth flood

leith hill
point of divergence
tobata ku, kitakyushu
send
tommie smith
simon reeve
send marsh
operation cartwheel
savitch's theorem
bernd munsteiner
nampeyo

eco industrial park
amado nervo
jacques poos
nspace
elyas yusof nezami ganjavi
jailbird
dtime
ntime
focal (hp 41)
mark lanegan
p (complexity)

rainis
toyota mr2
the book of the duchess
ilya yefimovich repin
steven smith (astronaut)
steven smith
tilman riemenschneider
gerousia
anthraquinone
ntm
andrei rublev