scientific article; zbMATH DE number 7204282
From MaRDI portal
Publication:5111162
Recommendations
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
- scientific article; zbMATH DE number 1775446
- Exponential size lower bounds for some depth three circuits
- Lower bounds for the circuit size of partially homogeneous polynomials
- Exponential lower bound for bounded depth circuits with few threshold gates
- The computational power of depth five arithmetic circuits
- scientific article; zbMATH DE number 1929951
- Exponential lower bounds for depth three Boolean circuits
- Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
- scientific article; zbMATH DE number 1379303
Cited in
(9)- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
- On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree
- The computational power of depth five arithmetic circuits
- On geometric complexity theory: multiplicity obstructions are stronger than occurrence obstructions
- Lower bounds for multilinear order-restricted ABPs
- On the Symmetries of and Equivalence Test for Design Polynomials.
- scientific article; zbMATH DE number 7561765 (Why is no real title available?)
- scientific article; zbMATH DE number 7250151 (Why is no real title available?)
- scientific article; zbMATH DE number 7250153 (Why is no real title available?)
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 Q5111162)