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.
2014
2014
Collapsing Exact Arithmetic Hierarchies
We provide a uniform framework for proving the collapse of the hierarchy \({\sf NC}^1(\mathcal{C})\) for an exact arithmetic… 
2009
2009
Efficient algorithms for descendant-only tree pattern queries
2007
2007
Generalized quantifier and a bounded arithmetic theory for LOGCFL
We define a theory of two-sort bounded arithmetic whose provably total functions are exactly those in $${\mathcal{F}_{LOGCFL… 
2007
2007
Unidirectional Lambek Grammars in Polynomial Time
, 
2006
2006
Derandomization of probabilistic auxiliary pushdown automata classes
We extend Nisan's breakthrough derandomization result that BP<sub>H</sub>L sube SC<sup>2</sup> (1992) to bounded error… 
2004
2004
On the reducibility of sets inside NP to sets with low information content
2002
2002
Nepomnjascij's Theorem and Independence Proofs in Bounded Arithmetic
  • C. Pollett
  • Electron. Colloquium Comput. Complex.
  • 2002
  • Corpus ID: 17886626
The use of Nepomnjascǐi’s Theorem in the proofs of independence results for bounded arithmetic theories is investigated. Using… 
1999
1999
HRNCE Grammars - a Hypergraph Generating System with an eNCE Way of Rewriting
1993
1993
Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality
We describe an O(log3n) time NC approximation algorithm for the CREW P-RAM, using n3/ log n processors with a 2log3n performance… 
1992
1992
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits ( Preliminary Version )
In this paper time-bounded auxiliary push-down automata (AuxPDA), i.e. time and space bounded Turing machines with additional… 
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)