Nspace

In computational complexity theory, the complexity class NSPACE(f(n)) is the set of decision problems that can be solved by a non-deterministic Turing machine using space O(f(n)), and unlimited time. It is the non-deterministic counterpart of DSPACE. The complexity class NPSPACE can be defined in terms of NSPACE as follows:
\mbox{NPSPACE} = \bigcup_{k\in\mathbb{N}} \mbox{NSPACE}(n^k)

 

<< PreviousWord BrowserNext >>
the riverboat song
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
dspace
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
Copyright 2005-2009 OnPedia.com. All Rights Reserved