New bivariate Hensel lifting algorithm for n factors

DOI10.1145/3377006.3377021MaRDI QIDQ5060840zbMATH OpenOpenAlexFDO

Authors Garrett Paluck, Michael Monagan

Publication date 11 January 2023

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

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

zbMATH Keywords

Hensel liftingmodular methodspolynomial evaluationpolynomial factorizationpolynomial interpolation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1262433
• Hensel lifting and bivariate polynomial factorisation over finite fields
• Sharp precision in Hensel lifting for bivariate polynomial factorization
• New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
• Complexity issues in bivariate polynomial factorization

Cited in

(3)

• The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization
• Sharp precision in Hensel lifting for bivariate polynomial factorization
• scientific article; zbMATH DE number 3984564 (Why is no real title available?)

This page was built for publication: New bivariate Hensel lifting algorithm for n factors

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