scientific article; zbMATH DE number 1775446
From MaRDI portal
Publication:4542578
Recommendations
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
- Depth-3 arithmetic circuits over fields of characteristic zero
- Exponential size lower bounds for some depth three circuits
- Arithmetic circuits: a chasm at depth 3
- An almost cubic lower bound for depth three arithmetic circuits
Cited in
(39)- Exponential size lower bounds for some depth three circuits
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
- Ulrich complexity
- Multi-k-ic depth three circuit lower bound
- Circuit and decision tree complexity of some number theoretic problems
- Affine projections of symmetric polynomials.
- Limitations of sums of bounded read formulas and ABPs
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
- Unifying known lower bounds via geometric complexity theory
- A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle
- On the limits of depth reduction at depth 3 over small finite fields
- Arithmetic circuits: a chasm at depth 3
- A Selection of Lower Bounds for Arithmetic Circuits
- On the limits of depth reduction at depth 3 over small finite fields
- A lower bound for depth-3 circuits with MOD m gates
- An exponential lower bound for homogeneous depth four arithmetic formulas
- On the power of homogeneous depth 4 arithmetic circuits
- Elusive functions and lower bounds for arithmetic circuits
- Permanent does not have succinct polynomial size arithmetic circuits of constant depth
- Lower bounds for depth-three arithmetic circuits with small bottom fanin
- The limits of depth reduction for arithmetic formulas: it's all about the top fan-in
- Arithmetic circuits: the chasm at depth four gets wider
- An almost cubic lower bound for depth three arithmetic circuits
- Lower bounds for depth three arithmetic circuits with small bottom fanin
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree
- The computational power of depth five arithmetic circuits
- Arithmetic circuit lower bounds via maximum-rank of partial derivative matrices
- On the Symmetries of and Equivalence Test for Design Polynomials.
- A super-quadratic lower bound for depth four arithmetic circuits
- scientific article; zbMATH DE number 7561765 (Why is no real title available?)
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
- scientific article; zbMATH DE number 7204282 (Why is no real title available?)
- scientific article; zbMATH DE number 7250151 (Why is no real title available?)
- Arithmetic circuit lower bounds via MaxRank
- Approaching the chasm at depth four
- Depth-3 arithmetic circuits over fields of characteristic zero
- Lower bounds and separations for constant depth multilinear circuits
- Symmetric arithmetic circuits
- Symmetric arithmetic circuits
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542578)
