Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
From MaRDI portal
Publication:2894535
DOI10.1090/S0025-5718-2011-02562-7zbMath1271.12006OpenAlexW1966002665WikidataQ114093832 ScholiaQ114093832MaRDI QIDQ2894535
Jérémy Berthomieu, Grégoire Lecerf
Publication date: 29 June 2012
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2011-02562-7
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in real and complex fields: factorization (12D05) Polynomials, factorization in commutative rings (13P05)
Related Items
Bounded-degree factors of lacunary multivariate polynomials, Factoring bivariate polynomials using adjoints, Sparse bivariate polynomial factorization, On the complexity of the Lickteig-Roy subresultant algorithm, A recombination algorithm for the decomposition of multivariate rational functions, Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- 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
- On multiplication and factorization of polynomials. I: Lexicographic orderings and extreme aggregates of terms
- On square-free factorization of multivariate polynomials over a finite field.
- Irreducibility of polynomials modulo \(p\) via Newton polytopes.
- Fast separable factorization and applications
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- Improved dense multivariate polynomial factorization algorithms
- Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Pick's Theorem
- Factoring polynomials via polytopes
- Complexity issues in bivariate polynomial factorization
- Factoring multivariate polynomials via partial differential equations