In computational complexity theory, LOGCFL is the complexity class that contains all decision problems that can be reduced in logarithmic space to a context-free...
3 KB (255 words) - 04:23, 14 April 2024
by an interactive proof system L Solvable with logarithmic (small) space LOGCFL Logspace-reducible to a context-free language MA Solvable in polynomial...
8 KB (176 words) - 07:24, 19 June 2024
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...
4 KB (287 words) - 06:51, 6 July 2021
conjunctive queries. The query evaluation, and thus query containment, is LOGCFL-complete and thus in polynomial time. Acyclicity of conjunctive queries...
15 KB (1,922 words) - 01:57, 13 December 2023
prove other theorems in computational complexity, including the closure of LOGCFL under complementation and the existence of error-free randomized logspace...
10 KB (1,272 words) - 08:08, 23 March 2024