Pages that link to "Item:Q442109"

The following pages link to Arithmetic circuits: the chasm at depth four gets wider (Q442109):

Displaying 42 items.

• The arithmetic complexity of tensor contraction (Q290898) (← links)
• Lower bounds for depth-three arithmetic circuits with small bottom fanin (Q301527) (← links)
• Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
• Lower bounds by Birkhoff interpolation (Q511113) (← links)
• Multi-\(k\)-ic depth three circuit lower bound (Q1694000) (← links)
• Lower bounds for matrix factorization (Q2041242) (← links)
• Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
• Depth-4 lower bounds, determinantal complexity: a unified approach (Q2281250) (← links)
• Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
• A \(\tau \)-conjecture for Newton polygons (Q2340507) (← links)
• Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
• Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
• On the limits of depth reduction at depth 3 over small finite fields (Q2407087) (← links)
• Improved bounds for reduction to depth 4 and depth 3 (Q2514141) (← links)
• Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science (Q2672320) (← links)
• Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← links)
• Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
• Algebraic Complexity Classes (Q2821695) (← links)
• A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
• $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
• The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← links)
• Log-Concavity and Lower Bounds for Arithmetic Circuits (Q2946406) (← links)
• Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210) (← links)
• An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
• On the Power of Homogeneous Depth 4 Arithmetic Circuits (Q2968157) (← links)
• Lower Bounds for Sums of Powers of Low Degree Univariates (Q3448839) (← 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)
• 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)
• (Q5121900) (← links)
• (Q5121901) (← links)
• Approaching the Chasm at Depth Four (Q5501936) (← links)
• Shadows of Newton polytopes (Q6076195) (← links)
• Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\) (Q6542431) (← links)
• Lower bounds for the sum of small-size algebraic branching programs (Q6636102) (← links)