Pages that link to "Item:Q1176109"

The following pages link to Properties that characterize LOGCFL (Q1176109):

Displaying 36 items.

• Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
• Tradeoff lower lounds for stack machines (Q744614) (← links)
• Generalized quantifier and a bounded arithmetic theory for LOGCFL (Q884960) (← links)
• Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} (Q968272) (← links)
• The complexity of short two-person games (Q1173637) (← links)
• Properties that characterize LOGCFL (Q1176109) (← links)
• Extensions to Barrington's M-program model (Q1208406) (← links)
• Unambiguity of circuits (Q1208408) (← links)
• Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
• Properties of probabilistic pushdown automata (Q1274989) (← links)
• Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones (Q1285764) (← links)
• The complexity of computing maximal word functions (Q1321032) (← links)
• From bidirectionality to alternation. (Q1401248) (← links)
• Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
• Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
• String shuffle: circuits and graphs (Q2018545) (← links)
• Two dynamic programming algorithms for which interpreted pebbling helps (Q2277375) (← links)
• The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
• Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
• Dual VP classes (Q2410687) (← links)
• Parallelizing time with polynomial circuits (Q2429726) (← links)
• Complexity theory for splicing systems (Q2455600) (← links)
• Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
• The dynamic complexity of acyclic hypergraph homomorphisms (Q2672439) (← links)
• Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits (Q2773024) (← links)
• Cost Register Automata for Nested Words (Q2817901) (← links)
• String distances and intrusion detection: Bridging the gap between formal languages and computer security (Q3431441) (← links)
• (Q4972729) (← links)
• Properties of probabilistic pushdown automata (Q5055907) (← links)
• Empty alternation (Q5096908) (← links)
• On growing context-sensitive languages (Q5204308) (← links)
• Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS (Q5462671) (← links)
• The descriptive complexity approach to LOGCFL (Q5946058) (← links)
• Computing LOGCFL certificates (Q5958329) (← links)
• Subclasses of \textsc{Ptime} interpreted by programming languages (Q6109064) (← links)