Nexpspace
In
computational complexity theory
, the
complexity class
NEXPSPACE
is the set of
decision problems
that can be solved by a
non-deterministic Turing machine
in space
O
(2
p
(n)
) for some polynomial function
p
(n). In terms of
NSPACE
,
\mbox{NEXPSPACE} = \bigcup_{k\in\mathbb{N}} \mbox{NSPACE}(2^{n^k})
<< Previous
Word Browser
Next >>
jerome robbins
neyland
sliding filament mechanism
birsay
glanamman
minister of the environment
gorseinon
akupara
gradient index optics
green grow the rushes, o
earl's palace, birsay
bromelain
phil jackson
neil aggett
sumer is icumen in
white citizens' council
gometra
323 brucia
sword of laban
lion's mane jellyfish
nanais
emil gilels
lackawaxen river
toronto environmental coalition
sessile
doro
espace
uk general election, 2005
nespace
nexptime
bentalha massacre
calliactis
ne (complexity)
e (complexity)
lackawanna river
abreaction photography
kenan thompson
northeast
atria
john sutton, 3rd lord dudley
northwest
balanus
rem (mythology)
william eliot, 2nd earl of st germans
Copyright 2005-2009 OnPedia.com. All Rights Reserved