scientific article; zbMATH DE number 3977110

MaRDI QIDQ3743382zbMATH OpenFDO

Authors Erich L. Kaltofen

Publication date 1985

zbMATH Keywords

algorithmfactorization of a single univariate imageGCD of multivariate polynomialsHensel lemmamultivariate leading coefficients of polynomial factorssparse Hensel liftingunivariate images

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over commutative rings (13B25) Symbolic computation and algebraic computation (68W30)

Recommendations

• The complexity of sparse Hensel lifting and sparse polynomial factorization
• Using sparse interpolation in Hensel lifting
• Sparse multivariate Hensel lifting: a high-performance design and implementation
• Sparse bivariate polynomial factorization
• scientific article; zbMATH DE number 3984564

Cited in

(21)

• A fast parallel sparse polynomial GCD algorithm
• The complexity of sparse Hensel lifting and sparse polynomial factorization
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
• Improved dense multivariate polynomial factorization algorithms
• An improved EZ-GCD algorithm for multivariate polynomials
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
• Using sparse interpolation in Hensel lifting
• Enhancing the Extended Hensel Construction by Using Gröbner Bases
• Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
• Sparse bivariate polynomial factorization
• A New Black Box Factorization Algorithm - the Non-monic Case
• Chinese Remainder Theorem for bivariate lexicographic Gröbner bases
• New Sparse Multivariate Polynomial Factorization Algorithms over Integers
• New Characterization of the Factor Refinement Algorithm with Applications
• \textsc{Rings}: an efficient Java/Scala library for polynomial rings
• Determining the structure of the Jordan normal form of a matrix by symbolic computation
• Factoring sparse polynomials fast
• A Maple program to factor multivariate polynomials given by black boxes
• A new sparse polynomial GCD by separating terms
• Parallel algorithms for matrix normal forms
• New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

This page was built for publication:

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