---
title: LOGCFL
slug: logcfl
qid: Q448600
snapshot: logcfl-051716-95dca20df079d519
content_hash: 95dca20df079d519a500dde94dbf5d7bb0958121af66634cfeb52abac9579188
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1329521674
tags: [23057298, 23118434, 23468805, 23603337, 26706142, 28699527, 73139800]
---

# LOGCFL

> [!note] Provenance
> Snapshot `logcfl-051716-95dca20df079d519` · content root `95dca20df079d519…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1329521674> · Licensed CC BY-SA 4.0

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 language. This class is closed under complementation. It is situated between NL and AC 1 , in the sense that it contains the former and is contained in the latter. Problems that are complete for LOGCFL include many problems that can be characterized by acyclic hypergraphs: * evaluating acyclic Boolean conjunctive queries * checking the existence of a homomorphism between two acyclic relational structures * checking the existence of solutions of acyclic constraint satisfaction problems LOGCFL is the set of decision problems solvable by nondeterministic auxiliary pushdown automata in log space and polynomial time.

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 language. This class is closed under complementation. It is situated between NL and AC 1 , in the sense that it contains the former and is contained in the latter. Problems that are complete for LOGCFL include many problems that can be characterized by acyclic hypergraphs: evaluating acyclic Boolean conjunctive queries checking the existence of a homomorphism between two acyclic relational structures checking the existence of solutions of acyclic constraint satisfaction problems LOGCFL is the set of decision problems solvable by nondeterministic auxiliary pushdown automata in log space and polynomial time. ==See also== List of complexity classes ==References== ==External links==
