A superfast randomized algorithm to decompose binary forms

DOI10.1145/2930889.2930896MaRDI QIDQ2985811zbMATH OpenOpenAlexFDO

Authors Matías R. Bender, Jean-Charles Faugère, 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

algebraic degreebinary form decompositioncanonical formcomplexityHankel matrixsuperfast algorithmWaring's problem

Mathematics Subject Classification ID

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

Recommendations

• A nearly optimal algorithm to decompose binary forms
• Symmetric tensor decomposition
• Derandomization and absolute reconstruction for sums of powers of linear forms
• Rank-\(r\) decomposition of symmetric tensors
• Generating polynomials and symmetric tensor decompositions

Cited in

(6)

• A nearly optimal algorithm to decompose binary forms
• Semialgebraic sets and real binary forms decompositions
• Efficient prediction algorithms for binary decomposition techniques
• Random arithmetic formulas can be reconstructed efficiently
• Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
• The symmetric rank of 2 2 2 symmetric tensors over an arbitrary field

This page was built for publication: A superfast randomized algorithm to decompose binary forms

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