On the Symmetries of and Equivalence Test for Design Polynomials.

Recommendations

On the complexity of symmetric polynomials
Affine projections of symmetric polynomials.
Deterministic polynomial identity testing in non-commutative models
Testing polynomial equivalence by scaling matrices
Diagonal Circuit Identity Testing and Lower Bounds

Cites work

\(\Sigma_ 1^ 1\)-formulae on finite structures
A super-polynomial lower bound for regular arithmetic formulas
Affine projections of polynomials (extended abstract)
An almost cubic lower bound for depth three arithmetic circuits
An exponential lower bound for homogeneous depth four arithmetic formulas
Approaching the chasm at depth four
Arithmetic circuits with locally low algebraic rank
Barriers for rank methods in arithmetic complexity
Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP
Depth-4 lower bounds, determinantal complexity: a unified approach
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity
Generalized matrix completion and algebraic natural proofs
Geometric aspects of iterated matrix multiplication
Geometric complexity theory. I: An approach to the P vs. NP and related problems
Hardness vs randomness
scientific article; zbMATH DE number 4191094 (Why is no real title available?)
scientific article; zbMATH DE number 3870631 (Why is no real title available?)
scientific article; zbMATH DE number 4008289 (Why is no real title available?)
scientific article; zbMATH DE number 1775446 (Why is no real title available?)
scientific article; zbMATH DE number 2151804 (Why is no real title available?)
scientific article; zbMATH DE number 7204282 (Why is no real title available?)
Lie Groups, Lie Algebras, and Representations
Lower bounds and separations for constant depth multilinear circuits
Lower bounds for depth-4 formulas computing iterated matrix multiplication
Lower bounds for depth-three arithmetic circuits with small bottom fanin
Lower Bounds in a Parallel Model without Bit Operations
Lower bounds on arithmetic circuits via partial derivatives
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
Multi-linear formulas for permanent and determinant are of super-polynomial size
Natural proofs
On P vs. NP and geometric complexity theory: dedicated to Sri Ramakrishna
On the power of homogeneous depth 4 arithmetic circuits
On the size of homogeneous and of depth four formulas with low individual degree
On vanishing of Kronecker coefficients
Partial derivatives in arithmetic complexity and beyond
Proving SAT does not have small circuits with an application to the two queries problem
Reconstruction of full rank algebraic branching programs
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications.
Succinct hitting sets and barriers to proving algebraic circuits lower bounds
Sums of products of polynomials in few variables: lower bounds and polynomial identity testing
Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits
The boundary of the orbit of the 3-by-3 determinant polynomial
The monotone circuit complexity of Boolean functions
The Permanent Function

Cited in

(2)

On the complexity of symmetric polynomials
Testing equivalence to design polynomials

This page was built for publication: On the Symmetries of and Equivalence Test for Design Polynomials.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092415)