The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization
From MaRDI portal
Publication:2110212
DOI10.1007/978-3-030-60026-6_9OpenAlexW3095314349MaRDI QIDQ2110212
Publication date: 21 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-60026-6_9
polynomial factorizationsparse interpolationCilk Cbivariate Hensel liftingmultivariate Diophantine equationssparse multivariate Hensel lifting
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: The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization