A polynomial time algorithm for computing all minimal decompositions of a polynomial
From MaRDI portal
Publication:5255833
DOI10.1145/2644288.2644292zbMath1314.12002arXiv1107.0687OpenAlexW2033673492MaRDI QIDQ5255833
Publication date: 19 June 2015
Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.0687
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
The Prouhet-Tarry-Escott problem, indecomposability of polynomials and Diophantine equations ⋮ Counting decomposable polynomials with integer coefficients ⋮ Counting invariant subspaces and decompositions of additive polynomials ⋮ Tame decompositions and collisions
This page was built for publication: A polynomial time algorithm for computing all minimal decompositions of a polynomial
