Affine projections of polynomials
From MaRDI portal
Publication:5415507
DOI10.1145/2213977.2214036zbMath1286.68197OpenAlexW2056575218MaRDI QIDQ5415507
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2213977.2214036
determinantreconstructionpermanentaffine projectionpolynomial equivalencedepth three circuitwaring problem for polynomials
Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (18)
Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Lower bounds for depth-three arithmetic circuits with small bottom fanin ⋮ Isomorphism testing of read-once functions and polynomials ⋮ Sparse multivariate polynomial interpolation on the basis of Schubert polynomials ⋮ Holographic algorithms beyond matchgates ⋮ Barriers for Rank Methods in Arithmetic Complexity ⋮ Random arithmetic formulas can be reconstructed efficiently ⋮ Complexity classes and completeness in algebraic geometry ⋮ Unnamed Item ⋮ Depth-4 lower bounds, determinantal complexity: a unified approach ⋮ Average-case linear matrix factorization and reconstruction of low width algebraic branching programs ⋮ Reconstruction algorithms for sums of affine powers ⋮ Determinant Equivalence Test over Finite Fields and over Q ⋮ On the Symmetries of and Equivalence Test for Design Polynomials. ⋮ Linear projections of the Vandermonde polynomial ⋮ Approaching the Chasm at Depth Four ⋮ Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
This page was built for publication: Affine projections of polynomials
