A Superfast Randomized Algorithm to Decompose Binary Forms

DOI10.1145/2930889.2930896zbMath1361.68300OpenAlexW2500222967MaRDI QIDQ2985811

Jean-Charles Faugère, Matías R. Bender, Ludovic Perret, Elias P. Tsigaridas

Publication date: 10 May 2017

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

Full work available at URL: https://hal.inria.fr/hal-01363545/file/binaryFormDecomposition.pdf

zbMATH Keywords

complexityHankel matrixWaring's problemcanonical formalgebraic degreesuperfast algorithmbinary form decomposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Vector and tensor algebra, theory of invariants (15A72) Multilinear algebra, tensor calculus (15A69) Randomized algorithms (68W20) Canonical forms, reductions, classification (15A21)

Related Items (3)

A nearly optimal algorithm to decompose binary forms ⋮ Semialgebraic sets and real binary forms decompositions ⋮ Reconstruction algorithms for sums of affine powers

This page was built for publication: A Superfast Randomized Algorithm to Decompose Binary Forms