Pages that link to "Item:Q2968157"
From MaRDI portal
The following pages link to On the Power of Homogeneous Depth 4 Arithmetic Circuits (Q2968157):
Displaying 14 items.
- Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit (Q1402306) (← links)
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
- Lower bounds for arithmetic circuits via the Hankel matrix (Q2051372) (← links)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
- Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210) (← links)
- Formulas versus Circuits for Small Distance Connectivity (Q4554075) (← links)
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree (Q4612480) (← links)
- (Q4612482) (← links)
- The Computational Power of Depth Five Arithmetic Circuits (Q4629389) (← links)
- Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications (Q4646460) (← 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)
- On Computing Multilinear Polynomials Using Multi- <i>r</i> -ic Depth Four Circuits (Q5868876) (← links)
