scientific article
From MaRDI portal
Publication:3743382
zbMath0605.12011MaRDI QIDQ3743382
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmHensel lemmaGCD of multivariate polynomialsfactorization of a single univariate imagemultivariate leading coefficients of polynomial factorssparse Hensel liftingunivariate images
Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over commutative rings (13B25)
Related Items (18)
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ 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 ⋮ Factoring multivariate polynomials represented by black boxes: a Maple + C implementation ⋮ \textsc{Rings}: an efficient Java/Scala library for polynomial rings ⋮ Sparse bivariate polynomial factorization ⋮ Improved dense multivariate polynomial factorization algorithms ⋮ Determining the structure of the Jordan normal form of a matrix by symbolic computation ⋮ A fast parallel sparse polynomial GCD algorithm ⋮ New recombination algorithms for bivariate polynomial factorization based on Hensel lifting ⋮ The complexity of sparse Hensel lifting and sparse polynomial factorization ⋮ An improved EZ-GCD algorithm for multivariate polynomials ⋮ Using Sparse Interpolation in Hensel Lifting ⋮ Enhancing the Extended Hensel Construction by Using Gröbner Bases ⋮ Parallel algorithms for matrix normal forms
This page was built for publication:
