Polynomial Equivalence Problems for Sum of Affine Powers

DOI10.1145/3208976.3208993zbMath1445.12002OpenAlexW2809345994MaRDI QIDQ5120210

Timothée Pecatte, Ignacio García-Marco, Pascal Koiran

Publication date: 9 September 2020

Published in: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3208976.3208993

zbMATH Keywords

reconstruction algorithmsWaring decompositionpolynomial equivalence

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Projective techniques in algebraic geometry (14N05) Computational methods for problems pertaining to field theory (12-08)

Related Items (3)

Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ Reconstruction algorithms for sums of affine powers

This page was built for publication: Polynomial Equivalence Problems for Sum of Affine Powers