- In com****tional
complexity theory,
LOGCFL is the
complexity class that
contains all
decision problems that can be
reduced in
logarithmic space to a context-free...
- by an
interactive proof system L
Solvable with
logarithmic (small)
space LOGCFL Logspace-reducible to a context-free
language MA
Solvable in polynomial...
-
prove other theorems in com****tional complexity,
including the
closure of
LOGCFL under complementation and the
existence of error-free
randomized logspace...
-
conjunctive queries. The
query evaluation, and thus
query containment, is
LOGCFL-complete and thus in
polynomial time.
Acyclicity of
conjunctive queries...
- NEXPTIME-complete NP-complete ∩,+,× P-hard, in co-NP L-hard, in
LOGCFL +,× P-hard, in co-NP L-hard, in
LOGCFL ∪,∩,−,+ PSPACE-complete PSPACE-complete ∪,∩,+ PSPACE-complete...
