Skip to search formSkip to main contentSkip to account menu

LOGCFL

In computational complexity theory, LOGCFL is the complexity class that contains all decision problems that can be reduced in logarithmic space to a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
AC (complexity)Circuits over sets of natural numbersComplete (complexity)Complexity class

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Isolation Lemma for Directed Reachability and NL vs. L
In this work we study the problem of efficiently isolating witnesses for the complexity classes NL and LogCFL, which are two well… 
2015
2015
Width-Parameterized SAT : Time-Space Tradeoffs
Alekhnovich and Razborov (2002) presented an algorithm that solves SAT on instances φ of size n and tree-width TW(φ), using time… 
2015
2015
Combined Complexity of Answering Tree-like Queries in OWL 2 QL
Introduction The OWL 2 QL ontology language [11], based upon the description logic DL-LiteR, is considered particularly well… 
2011
2011
The Descriptive Complexity Approach to LOGCFL Clemens Lautemann
2009
2009
Exploring LogCFL using language theory[HBNI Th 13]
2007
2007
Unidirectional Lambek Grammars in Polynomial Time
, 
2007
2007
IMPROVED UPPER BOUNDS IN NC FOR MONOTONE PLANAR CIRCUIT VALUE AND SOME RESTRICTIONS AND GENERALIZATIONS
The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC, and for the… 
1999
1999
Papers to Appear in Forthcoming Issues
Yonatan Aumann, Johan Hastad, Michael O. Rabin, and Madhu Sudan. Linear Consistency Testing Juraj Hromkovic and Sebastian Seibert… 
1998
1998
A Generalization of Finite-Turn Pushdown Automaton Languages and LOGCFL
1994
1994
Parallel Computational Complexity and Date-Transfer Complexity of Supercomputing
With the recent advance in hardware technology of very large-scale integration and parallel computer architecture, vector and… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)