Factoring polynomials over global fields
From MaRDI portal
Publication:1032662
DOI10.5802/jtnb.655zbMath1254.11116arXivmath/0409510OpenAlexW1776768376MaRDI QIDQ1032662
Jürgen Klüners, Mark van Hoeij, Karim Belabas, Allan K. Steel
Publication date: 26 October 2009
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0409510
Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Polynomials (irreducibility, etc.) (11R09)
Related Items
Towards faster polynomial-time lattice reduction, Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations, Modular Las Vegas algorithms for polynomial absolute factorization, Bivariate factorization using a critical fiber, Factorization and root-finding for polynomials over division quaternion algebras, Computational Number Theory, Past, Present, and Future, Fast separable factorization and applications, Gradual sub-lattice reduction and a new complexity for factoring polynomials, Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time, Algebraic osculation and application to factorization of sparse polynomials, Sparse bivariate polynomial factorization, Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, The van Hoeij Algorithm for Factoring Polynomials, Sharp precision in Hensel lifting for bivariate polynomial 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
- A unified method for multivariate polynomial factorizations
- Factoring polynomials and the knapsack problem
- Factoring polynomials with rational coefficients
- The Magma algebra system. I: The user language
- Factoring polynomials over global fields. I
- Factoring polynomials over global fields. II.
- On Hensel factorization. I
- A relative van Hoeij algorithm over number fields
- Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
- On the zeros of the derivative of a polynomial
- Complexity issues in bivariate polynomial factorization
- Floating-Point LLL Revisited