Complexity issues in bivariate polynomial factorization
From MaRDI portal
Recommendations
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Multi-modular approach to polynomial-time factorization of bivariate integral polynomials
- Lifting and recombination techniques for absolute factorization
- A lifting and recombination algorithm for rational factorization of sparse polynomials
Cited in
(32)- Towards toric absolute factorization
- Factoring polynomials over global fields
- Multi-modular approach to polynomial-time factorization of bivariate integral polynomials
- Bivariate factorization using a critical fiber
- Symbolic computations of first integrals for polynomial vector fields
- Fast Hermite interpolation and evaluation over finite fields of characteristic two
- Lifting and recombination techniques for absolute factorization
- A concise proof of the Kronecker polynomial system solver from scratch
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- 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
- Deterministic distinct-degree factorization of polynomials over finite fields
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
- A recombination algorithm for the decomposition of multivariate rational functions
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Towards factoring bivariate approximate polynomials
- Hensel lifting and bivariate polynomial factorisation over finite fields
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- scientific article; zbMATH DE number 4006369 (Why is no real title available?)
- scientific article; zbMATH DE number 1262433 (Why is no real title available?)
- Sparse bivariate polynomial factorization
- scientific article; zbMATH DE number 800174 (Why is no real title available?)
- New bivariate Hensel lifting algorithm for n factors
- On matrices with displacement structure: generalized operators and faster algorithms
- New Sparse Multivariate Polynomial Factorization Algorithms over Integers
- Modular Las Vegas algorithms for polynomial absolute factorization
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- Counting points on genus-3 hyperelliptic curves with explicit real multiplication
- Optimal pseudorandom generators for low-degree polynomials over moderately large fields
- Plane curve germs and contact factorization
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
This page was built for publication: Complexity issues in bivariate polynomial factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657300)
