Pages that link to "Item:Q1894446"
From MaRDI portal
The following pages link to Superlinear lower bounds for bounded-width branching programs (Q1894446):
Displaying 23 items.
- Non-uniform automata over groups (Q804303) (← links)
- An impossibility gap between width-4 and width-5 permutation branching programs (Q1041742) (← links)
- Meanders and their applications in lower bounds arguments (Q1115606) (← links)
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) (Q1117696) (← links)
- A note on a theorem of Barrington, Straubing and Thérien (Q1351160) (← links)
- Efficient oblivious branching programs for threshold and mod functions (Q1384527) (← links)
- An ergodic theorem for read-once non-uniform deterministic finite automata (Q1583045) (← links)
- Languages defined with modular counting quantifiers (Q1854424) (← links)
- Superpolynomial lower bounds for monotone span programs (Q1977413) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- A topological approach to non-uniform complexity (Q2280323) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- Learning expressions and programs over monoids (Q2490112) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- (Q3002761) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- (Q3991212) (← links)
- Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access (Q4032302) (← links)
- The Power of Diversity (Q5200079) (← links)
- SOLVABLE MONOIDS WITH COMMUTING IDEMPOTENTS (Q5316311) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
- Localizability of the approximation method (Q6624428) (← links)
