Factoring multivariate polynomials with many factors and huge coefficients

DOI10.1007/978-3-319-99639-4_22zbMath1453.13072OpenAlexW2888229921MaRDI QIDQ1798333

Baris Tuncer, Michael B. Monagan

Publication date: 23 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-99639-4_22

zbMATH Keywords

polynomial factorizationsparse polynomial interpolationpolynomial Diophantine equationsmultivariate Hensel lifting

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05) Real polynomials: analytic properties, etc. (26C05)

Related Items (8)

Computational schemes for subresultant chains ⋮ Parallelization of triangular decompositions: techniques and implementation ⋮ A New Black Box Factorization Algorithm - the Non-monic Case ⋮ New Sparse Multivariate Polynomial Factorization Algorithms over Integers ⋮ Factoring multivariate polynomials represented by black boxes: a Maple + C implementation ⋮ Detecting and parametrizing polynomial surfaces without base points ⋮ A tree distinguishing polynomial ⋮ The complexity of sparse Hensel lifting and sparse polynomial factorization

This page was built for publication: Factoring multivariate polynomials with many factors and huge coefficients