Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,658,309 papers from all fields of science
Search
Sign In
Create Free Account
LOGCFL
In computational complexity theory, LOGCFL is the complexity class that contains all decision problems that can be reduced in logarithmic space to a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
AC (complexity)
Circuits over sets of natural numbers
Complete (complexity)
Complexity class
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Collapsing Exact Arithmetic Hierarchies
N. Balaji
,
Samir Datta
Workshop on Algorithms and Computation
2014
Corpus ID: 8109428
We provide a uniform framework for proving the collapse of the hierarchy \({\sf NC}^1(\mathcal{C})\) for an exact arithmetic…
Expand
2009
2009
Efficient algorithms for descendant-only tree pattern queries
M. Götz
,
Christoph E. Koch
,
W. Martens
Information Systems
2009
Corpus ID: 15500146
2007
2007
Generalized quantifier and a bounded arithmetic theory for LOGCFL
S. Kuroda
Archive for Mathematical Logic
2007
Corpus ID: 38035412
We define a theory of two-sort bounded arithmetic whose provably total functions are exactly those in $${\mathcal{F}_{LOGCFL…
Expand
2007
2007
Unidirectional Lambek Grammars in Polynomial Time
Periklis A. Papakonstantinou
,
Gerald Penn
,
Yevgeniy Vahlis
2007
Corpus ID: 17056157
,
2006
2006
Derandomization of probabilistic auxiliary pushdown automata classes
H. Venkateswaran
Cybersecurity and Cyberforensics Conference
2006
Corpus ID: 1004022
We extend Nisan's breakthrough derandomization result that BP<sub>H</sub>L sube SC<sup>2</sup> (1992) to bounded error…
Expand
2004
2004
On the reducibility of sets inside NP to sets with low information content
Mitsunori Ogihara
,
Till Tantau
Journal of computer and system sciences (Print)
2004
Corpus ID: 11030898
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…
Expand
1999
1999
HRNCE Grammars - a Hypergraph Generating System with an eNCE Way of Rewriting
Changwook Kim
,
T. E. Jeong
Theoretical Computer Science
1999
Corpus ID: 29837047
1993
1993
Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality
N. Holloway
,
S. Ravindran
,
A. Gibbons
International Workshop on Graph-Theoretic…
1993
Corpus ID: 5555799
We describe an O(log3n) time NC approximation algorithm for the CREW P-RAM, using n3/ log n processors with a 2log3n performance…
Expand
1992
1992
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits ( Preliminary Version )
R. Niedermeier
,
P. Rossmanith
1992
Corpus ID: 7953078
In this paper time-bounded auxiliary push-down automata (AuxPDA), i.e. time and space bounded Turing machines with additional…
Expand
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)
ACCEPT & CONTINUE