Depth-3 arithmetic circuits over fields of characteristic zero
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1775446
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
- Affine projections of symmetric polynomials.
- Lower bounds for depth three arithmetic circuits with small bottom fanin
- Lower bounds for depth-three arithmetic circuits with small bottom fanin
Cited in
(57)- Lower bounds on arithmetic circuits via partial derivatives
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
- Affine projections of symmetric polynomials.
- Small space analogues of Valiant's classes and the limitations of skew formulas
- Limitations of sums of bounded read formulas and ABPs
- Quadratic lower bounds for algebraic branching programs and formulas
- On \(\epsilon\)-sensitive monotone computations
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees
- Geometric complexity theory: an introduction for geometers
- Unifying known lower bounds via geometric complexity theory
- On the limits of depth reduction at depth 3 over small finite fields
- The complexity of two problems on arithmetic circuits
- Arithmetic circuits: a chasm at depth 3
- Jacobian hits circuits: hitting sets, lower bounds for depth-D occur-k formulas and depth-3 transcendence degree-k circuits
- A Selection of Lower Bounds for Arithmetic Circuits
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
- Types of depth and formula size
- Uniform derandomization from pathetic lower bounds
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
- On the Expressive Power of Read-Once Determinants
- Elusive functions and lower bounds for arithmetic circuits
- Arithmetic complexity in ring extensions
- Permanent does not have succinct polynomial size arithmetic circuits of constant depth
- Lower bounds for depth-three arithmetic circuits with small bottom fanin
- Arithmetic circuits: a survey of recent results and open questions
- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
- The limits of depth reduction for arithmetic formulas: it's all about the top fan-in
- “Resistant” Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
- Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
- scientific article; zbMATH DE number 1775446 (Why is no real title available?)
- An almost cubic lower bound for depth three arithmetic circuits
- Lower bounds for depth three arithmetic circuits with small bottom fanin
- Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
- Arithmetic circuit lower bounds via maximum-rank of partial derivative matrices
- scientific article; zbMATH DE number 7471587 (Why is no real title available?)
- On the power of border of depth-3 arithmetic circuits
- scientific article; zbMATH DE number 7561742 (Why is no real title available?)
- A super-quadratic lower bound for depth four arithmetic circuits
- scientific article; zbMATH DE number 7204375 (Why is no real title available?)
- Lower bounds for matrix product, in bounded depth circuits with arbitrary gates
- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two
- Approaching the chasm at depth four
- Schur polynomials do not have small formulas if the determinant does not
- Lower bounds for the determinantal complexity of explicit low degree polynomials
- Homogeneous formulas and symmetric polynomials
- Symmetric arithmetic circuits
- Symmetric arithmetic circuits
- Low-depth algebraic circuit lower bounds over any field
- Superpolynomial lower bounds against low-depth algebraic circuits
- Improved lower bound, and proof barrier, for constant depth algebraic circuits
- On approximate symmetric polynomials and tightness of homogenization results
- Symmetric proofs in the ideal proof system
- New bounds for the ideal proof system in positive characteristic
- Deterministic polynomial identity tests for multilinear bounded-read formulae
- Resolution over linear equations and multilinear proofs
- Monotone separations for constant degree polynomials
This page was built for publication: Depth-3 arithmetic circuits over fields of characteristic zero
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957088)
