Affine projections of symmetric polynomials.
From MaRDI portal
Publication:1872730
DOI10.1016/S0022-0000(02)00021-1zbMath1059.68042MaRDI QIDQ1872730
Publication date: 14 May 2003
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items (4)
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials ⋮ Unnamed Item ⋮ Arithmetic Circuits: A Chasm at Depth 3 ⋮ Linear projections of the Vandermonde polynomial
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- \(\Sigma_ 1^ 1\)-formulae on finite structures
- The monotone circuit complexity of Boolean functions
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- The complexity of partial derivatives
- A lower bound on the number of additions in monotone computations
- Apolarity and canonical forms for homogeneous polynomials
- Communication in bounded depth circuits
- Lower bounds on arithmetic circuits via partial derivatives
- Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
- Threshold circuits of bounded depth
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
- Parity, circuits, and the polynomial-time hierarchy
- Size--Depth Tradeoffs for Threshold Circuits
- Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
- Lower bounds for matrix product, in bounded depth circuits with arbitrary gates
- Depth-3 arithmetic circuits over fields of characteristic zero
This page was built for publication: Affine projections of symmetric polynomials.
