Pages that link to "Item:Q1117696"

The following pages link to Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) (Q1117696):

Displayed 16 items.

• On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata (Q3503642) ‎ (← links)
• Extending regular expressions with homomorphic replacement (Q3566350) ‎ (← links)
• Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae (Q3599149) ‎ (← links)
• Descriptional and Computational Complexity of Finite Automata (Q3618565) ‎ (← links)
• Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG] (Q3618574) ‎ (← links)
• Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (Q3618608) ‎ (← links)
• Regular Languages Definable by Majority Quantifiers with Two Variables (Q3637216) ‎ (← links)
• An Algebraic Perspective on Boolean Function Learning (Q3648753) ‎ (← links)
• (Q4009550) ‎ (← links)
• <i>y</i>= 2<i>x</i>VS.<i>y</i>= 3<i>x</i> (Q4358061) ‎ (← links)
• MONOIDS AND COMPUTATIONS (Q4658713) ‎ (← links)
• The Power of Diversity (Q5200079) ‎ (← links)
• Circuit complexity of regular languages (Q5895106) ‎ (← links)
• The descriptive complexity approach to LOGCFL (Q5946058) ‎ (← links)
• On the complexity of some problems on groups input as multiplication tables (Q5956010) ‎ (← links)
• Branching program size is almost linear in formula size (Q5956012) ‎ (← links)