Pages that link to "Item:Q2949210"
From MaRDI portal
The following pages link to Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210):
Displaying 10 items.
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
- The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In (Q3451754) (← links)
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (Q4612480) (← links)
- (Q4612482) (← links)
- Barriers for Rank Methods in Arithmetic Complexity (Q4993264) (← links)
- (Q5089246) (← links)
- On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5111256) (← links)
- Lower bounds for special cases of syntactic multilinear ABPs (Q5919345) (← links)
