Fl (Complexity)
In
computational complexity theory
, the
complexity class
FL
is the set of
function problems
which can be solved by a
deterministic Turing machine
in a
logarithmic
amount of
memory space
. Loosely speaking, a function problem takes a complicated input and produces a (perhaps equally) complicated output. Function problems are distinguished from
decision problems
, which produce only Yes or No answers.
FL
corresponds to the set
L
of
decision problems
which can be solved in deterministic logspace.
FL
is a subset of
FP
, the set of function problems which can be solved in deterministic
polynomial time
.
FL
is known to contain several natural problems, including the
multiplication
of two numbers.
<< Previous
Word Browser
Next >>
hms ganges
list of educational institutions in toronto
mega man battle network
dyson perrins laboratory
sis cunnigham
3gp
list of parks in toronto
bo ryan
list of attractions in toronto
list of malls in toronto
toronto external contracts inquiry
nicolaus ii bernoulli
christian worldview
bottega veneta
tsukiyomi
dalian atkinson
wesley heights
the basic eight
major race
robert robinson (scientist)
st. mark's school of texas
nicolaus i bernoulli
cork school of music
uke mochi
uss chivo (ss 341)
the biggest loser
marjorie flack
the
marianne weber
susan pratt
karl larsson
olympic gold
hms ganges (1821)
gerry cheevers
ansi.sys
area 51 book series
wang ming
rosyth school
david busst
teresa daly
church of saint francis xavier, liverpool
johannes von saaz
fake (manga)
southcote
Copyright 2005-2009 OnPedia.com. All Rights Reserved