A relative van Hoeij algorithm over number fields
From MaRDI portal
Publication:2643532
DOI10.1016/j.jsc.2003.09.003zbMath1137.11360OpenAlexW1963728823MaRDI QIDQ2643532
Publication date: 24 August 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2003.09.003
Related Items
Towards faster polynomial-time lattice reduction, Computational Number Theory, Past, Present, and Future, On the hardness of the NTRU problem, Gradual sub-lattice reduction and a new complexity for factoring polynomials, Galois groups over rational function fields and explicit Hilbert irreducibility, The complexity of computing all subfields of an algebraic number field, List decoding of number field codes, Topics in computational algebraic number theory, Isomorphisms of algebraic number fields, Finding Integral Linear Dependencies of Algebraic Numbers and Algebraic Lie Algebras, Factoring polynomials over global fields
Uses Software
Cites Work
- Factoring polynomials and the knapsack problem
- Computing the measure of a polynomial
- Factoring polynomials with rational coefficients
- Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- KANT V4
- A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
- Approximating rings of integers in number fields
- On Hensel factorization. I
- On finding the largest root of a polynomial
- Factorization in Z[x]
- An Inequality About Factors of Polynomials
- An efficient algorithm for the computation of Galois automorphisms
- Factoring Polynomials Over Large Finite Fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
