Sparse bivariate polynomial factorization
From MaRDI portal
Publication:477285
DOI10.1007/s11425-014-4850-yzbMath1327.12005OpenAlexW2254485478MaRDI QIDQ477285
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
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials, factorization in commutative rings (13P05)
Related Items
Cites Work
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- A note on Gao's algorithm for polynomial factorization
- A unified method for multivariate polynomial factorizations
- Factoring polynomials and the knapsack problem
- Factoring bivariate sparse (lacunary) polynomials
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Factoring polynomials over global fields
- Factoring sparse multivariate polynomials
- Factoring polynomials with rational coefficients
- 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
- Lifting and recombination techniques for absolute factorization
- Fast separable factorization and applications
- Factoring bivariate polynomials using adjoints
- Improved dense multivariate polynomial factorization algorithms
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- 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
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Multivariate Polynomial Factorization
- Factoring Multivariate Polynomials Over the Integers
- An Improved Multivariate Polynomial Factoring Algorithm
- Factoring polynomials via polytopes
- Complexity issues in bivariate polynomial factorization
- Factoring multivariate polynomials via partial differential equations
- Hensel construction of F(x, u 1 , ..., x l ) l ≥ 2 at a singular point and its applications
- The van Hoeij Algorithm for Factoring Polynomials
- On the complexity of factoring bivariate supersparse (Lacunary) polynomials
- Factorization of multivariate polynomials by extended Hensel construction
- Absolute irreducibility of polynomials via Newton polytopes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item