The following pages link to (Q4542578):
Displaying 23 items.
- Lower bounds for depth-three arithmetic circuits with small bottom fanin (Q301527) (← links)
- Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
- Ulrich complexity (Q1679674) (← links)
- Multi-\(k\)-ic depth three circuit lower bound (Q1694000) (← links)
- Circuit and decision tree complexity of some number theoretic problems (Q1854439) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← 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)
- Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
- On the Power of Homogeneous Depth 4 Arithmetic Circuits (Q2968157) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← 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)
- The Computational Power of Depth Five Arithmetic Circuits (Q4629389) (← 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)
- (Q5092488) (← links)
- (Q5121899) (← links)
- Approaching the Chasm at Depth Four (Q5501936) (← links)
