Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization

From MaRDI portal
Publication:2110212
Jump to:navigation, search

DOI10.1007/978-3-030-60026-6_9OpenAlexW3095314349MaRDI QIDQ2110212

Tian Chen, Michael B. Monagan

Publication date: 21 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-60026-6_9


zbMATH Keywords

polynomial factorizationsparse interpolationCilk Cbivariate Hensel liftingmultivariate Diophantine equationssparse multivariate Hensel lifting


Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2110212&oldid=14608384"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 22:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki