Lifting and recombination techniques for absolute factorization
From MaRDI portal
Publication:2371310
DOI10.1016/J.JCO.2007.01.008zbMath1130.12007OpenAlexW2096571745MaRDI QIDQ2371310
Guillaume Chèze, Grégoire Lecerf
Publication date: 4 July 2007
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2007.01.008
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 (20)
Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ Computing Cox rings ⋮ Modular Las Vegas algorithms for polynomial absolute factorization ⋮ On a generalization of Stickelberger's theorem ⋮ A lifting and recombination algorithm for rational factorization of sparse polynomials ⋮ Bivariate factorization using a critical fiber ⋮ A concise proof of the Kronecker polynomial system solver from scratch ⋮ Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time ⋮ Rational integrability of trigonometric polynomial potentials on the flat torus ⋮ Computing monodromy via continuation methods on random Riemann surfaces ⋮ A note on Gao's algorithm for polynomial factorization ⋮ Algebraic osculation and application to factorization of sparse polynomials ⋮ Factoring bivariate polynomials using adjoints ⋮ Sparse bivariate polynomial factorization ⋮ Complexity of solving parametric polynomial systems ⋮ Indecomposability of polynomials via Jacobian matrix ⋮ Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem ⋮ Towards toric absolute factorization ⋮ A recombination algorithm for the decomposition of multivariate rational functions
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified method for multivariate polynomial factorizations
- Irreducible decomposition of curves
- Factoring polynomials and the knapsack problem
- Integration of rational functions: Rational computation of the logarithmic part
- Fast parallel absolute irreducibility testing
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- Linear differential equations and products of linear forms
- A note on subresultants and the Lazard/Rioboo/Trager formula in rational function integration
- Irreducibility of polynomials modulo \(p\) via Newton polytopes.
- Subresultants revisited.
- Probabilistic absolute irreducibility test for polynomials
- Computing the irreducible real factors and components of an algebraic curve
- Linear differential operators for polynomial equations
- Symbolic integration I: Transcendental functions
- Effective Noether irreducibility forms and applications
- Dynamic evaluation and algebraic closure in Axiom
- Liouvillian solutions of linear differential equations of order three and higher
- A new efficient factorization algorithm for polynomials over small finite fields
- Polynomial evaluation and interpolation on special sets of points
- Factoring polynomials over global fields. I
- Fast computation of special resultants
- From an approximate to an exact absolute polynomial factorization
- Improved dense multivariate polynomial factorization algorithms
- On Hensel factorization. I
- Semi-numerical absolute factorization of polynomials with integer coefficients
- Deterministic distinct-degree factorization of polynomials over finite fields
- Absolute Factorization of Polynomials: A Geometric Approach
- Sharp precision in Hensel lifting for bivariate polynomial factorization
- Reduzibilität ebener Kurven.
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Factoring Rational Polynomials over the Complex Numbers
- A Remark on the Hensel Factorization Method
- Factoring polynomials via polytopes
- Complexity issues in bivariate polynomial factorization
- Approximate factorization of multivariate polynomials via differential equations
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- Factoring multivariate polynomials via partial differential equations
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Absolute irreducibility of polynomials via Newton polytopes
- Decomposition of polytopes and polynomials
- On the links between triangular sets and dynamic constructible closure
This page was built for publication: Lifting and recombination techniques for absolute factorization
