E (Complexity)
In
computational complexity theory
, the
complexity class
E
is the set of
decision problems
that can be solved by a
deterministic Turing machine
in time
O
(
k
n
) for some
k
.
E
is less important to complexity theory than the similar class
EXPTIME
because it is not closed under
polynomial-time many-one reductions
.
<< Previous
Word Browser
Next >>
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
nexpspace
espace
uk general election, 2005
nespace
nexptime
bentalha massacre
calliactis
ne (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
artistic language
studebaker gran turismo hawk
logical language
gray mouse lemur
naveta
namazu
lyle and erik menendez
johann josef loschmidt