Fast Computation of the Roots of Polynomials Over the Ring of Power Series

DOI10.1145/3087604.3087642zbMath1444.68305arXiv1705.10658OpenAlexW3103484676MaRDI QIDQ5119960

Johan Rosenkilde, Éric Schost, Vincent Neiger

Publication date: 9 September 2020

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

Full work available at URL: https://arxiv.org/abs/1705.10658

zbMATH Keywords

power serieslist decodingpolynomial root-finding algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Decoding (94B35) Numerical computation of roots of polynomial equations (65H04)

Related Items (6)

Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation ⋮ An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function ⋮ A fast randomized geometric algorithm for computing Riemann-Roch spaces ⋮ Efficiently factoring polynomials modulo \(p^4\) ⋮ Unnamed Item

This page was built for publication: Fast Computation of the Roots of Polynomials Over the Ring of Power Series