Pages that link to "Item:Q2514141"

The following pages link to Improved bounds for reduction to depth 4 and depth 3 (Q2514141):

Displaying 15 items.

• Lower bounds for matrix factorization (Q2041242) (← links)
• Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
• Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. (Q3304115) (← links)
• The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In (Q3451754) (← links)
• Equations for secant varieties of Chow varieties (Q4601326) (← 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)
• The method of shifted partial derivatives cannot separate the permanent from the determinant (Q4637587) (← links)
• Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications (Q4646460) (← links)
• Towards Optimal Depth Reductions for Syntactically Multilinear Circuits (Q5091237) (← links)
• Lower bounds for matrix factorization (Q5092452) (← links)
• A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
• (Q5092488) (← links)
• (Q5121901) (← links)