Sparse bivariate polynomial factorization
From MaRDI portal
Recommendations
- Factoring polynomials via polytopes
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- Complexity issues in bivariate polynomial factorization
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Sharp precision in Hensel lifting for bivariate polynomial factorization
Cites work
- scientific article; zbMATH DE number 3887067 (Why is no real title available?)
- scientific article; zbMATH DE number 3977110 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3757697 (Why is no real title available?)
- scientific article; zbMATH DE number 15339 (Why is no real title available?)
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 1262433 (Why is no real title available?)
- scientific article; zbMATH DE number 1305293 (Why is no real title available?)
- scientific article; zbMATH DE number 1305294 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 2151173 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- A note on Gao's algorithm for polynomial factorization
- A polynomial time algorithm for diophantine equations in one variable
- A unified method for multivariate polynomial factorizations
- Absolute irreducibility of polynomials via Newton polytopes
- An Improved Multivariate Polynomial Factoring Algorithm
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Analysis of approximate factorization algorithm. I
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Complexity issues in bivariate polynomial factorization
- Convergence and many-valuedness of Hensel series near the expansion point
- Factoring Multivariate Polynomials Over the Integers
- Factoring bivariate lacunary polynomials without heights
- Factoring bivariate polynomials using adjoints
- Factoring bivariate sparse (lacunary) polynomials
- Factoring multivariate polynomials via partial differential equations
- Factoring polynomials and the knapsack problem
- Factoring polynomials over global fields
- Factoring polynomials via polytopes
- Factoring polynomials with rational coefficients
- Factoring sparse multivariate polynomials
- Factorization of multivariate polynomials by extended Hensel construction
- Fast separable factorization and applications
- Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
- Hensel construction of F(x, u 1 , ..., x l ) l ≥ 2 at a singular point and its applications
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Improved dense multivariate polynomial factorization algorithms
- Lifting and recombination techniques for absolute factorization
- Modern computer algebra
- Multivariate Polynomial Factorization
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Numerical recipes. The art of scientific computing.
- On the complexity of factoring bivariate supersparse (lacunary) polynomials
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Solving multivariate algebraic equation by Hensel construction
- The van Hoeij algorithm for factoring polynomials
Cited in
(9)- Factoring sparse bivariate polynomials using the priority queue
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Algebraic osculation and application to factorization of sparse polynomials
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- scientific article; zbMATH DE number 3977110 (Why is no real title available?)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Extracting sparse factors from multivariate integral polynomials
- 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)
