Sparse bivariate polynomial factorization

DOI10.1007/S11425-014-4850-YzbMATH Open1327.12005OpenAlexW2254485478MaRDI QIDQ477285FDOQ477285

Jingwei Chen, Wenyuan Wu, Yong Feng

Publication date: 3 December 2014

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-014-4850-y

zbMATH Keywords

sparse polynomialpolynomial factorizationgeneralized Hensel lifting

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials, factorization in commutative rings (13P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Absolute irreducibility of polynomials via Newton polytopes
• Factoring polynomials with rational coefficients
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
• Factoring sparse multivariate polynomials
• Fast separable factorization and applications
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• Modern computer algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Factoring polynomials via polytopes
• Factoring multivariate polynomials via partial differential equations
• Title not available (Why is that?)
• An Improved Multivariate Polynomial Factoring Algorithm
• Title not available (Why is that?)
• Hensel construction of F(x, u ₁ , ..., x _l ) l ≥ 2 at a singular point and its applications
• Factoring polynomials over global fields
• Lifting and recombination techniques for absolute factorization
• Improved dense multivariate polynomial factorization algorithms
• A lifting and recombination algorithm for rational factorization of sparse polynomials
• Factoring bivariate sparse (lacunary) polynomials
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Analysis of approximate factorization algorithm. I
• A polynomial time algorithm for diophantine equations in one variable
• Solving multivariate algebraic equation by Hensel construction
• Factoring bivariate polynomials using adjoints
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
• Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
• Convergence and many-valuedness of hensel seriesnear the expansion point
• Factoring bivariate lacunary polynomials without heights
• Title not available (Why is that?)
• Sharp precision in Hensel lifting for bivariate polynomial factorization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multivariate Polynomial Factorization
• Factoring Multivariate Polynomials Over the Integers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity issues in bivariate polynomial factorization
• The van Hoeij Algorithm for Factoring Polynomials
• On the complexity of factoring bivariate supersparse (Lacunary) polynomials
• Factorization of multivariate polynomials by extended Hensel construction
• A note on Gao's algorithm for polynomial factorization
• A unified method for multivariate polynomial factorizations
• Factoring polynomials and the knapsack problem
• New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

Cited In (2)

• Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
• Sparse polynomial prediction

This page was built for publication: Sparse bivariate polynomial factorization

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