Linear Hensel Lifting for Fp[x,y] and Z[x] with Cubic Cost

DOI10.1145/3326229.3326242zbMath1467.12002OpenAlexW2959288799WikidataQ131135051 ScholiaQ131135051MaRDI QIDQ5121120

Michael B. Monagan

Publication date: 10 September 2020

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

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

zbMATH Keywords

polynomial factorizationmodular methodsHensel lifting

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Factorization (11Y05) Computational methods for problems pertaining to field theory (12-08)

Related Items (2)

A New Black Box Factorization Algorithm - the Non-monic Case ⋮ Factoring multivariate polynomials represented by black boxes: a Maple + C implementation

This page was built for publication: Linear Hensel Lifting for Fp[x,y] and Z[x] with Cubic Cost