Local polynomial factorisation. Improving the montes algorithm

DOI10.1145/3476446.3535487MaRDI QIDQ6665749zbMATH OpenFDO

Authors Adrien Poteaux, Martin Weimann

Publication date 17 January 2025

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

zbMATH Keywords

approximate rootsarithmetic complexitycomputer algebradiscrete valuation ringsgeneralised Newton polygonsmontes algorithmpolynomial factorisation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited in

(5)

• Polynomial factorization over Henselian fields
• Plane curve germs and contact factorization
• Validated numerical Hensel lifting
• On OM algorithms and cluster pictures
• Improvements of convex-dense factorization of bivariate polynomials

This page was built for publication: Local polynomial factorisation. Improving the montes algorithm

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