A relative van Hoeij algorithm over number fields
From MaRDI portal
Publication:2643532
Recommendations
Cites work
- A course in computational algebraic number theory
- A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
- An efficient algorithm for the computation of Galois automorphisms
- An Inequality About Factors of Polynomials
- Approximating rings of integers in number fields
- Class field theory
- Computing the measure of a polynomial
- Factoring polynomials and the knapsack problem
- Factoring Polynomials Over Large Finite Fields
- Factoring polynomials with rational coefficients
- Factorization in Z[x]
- scientific article; zbMATH DE number 3860385 (Why is no real title available?)
- scientific article; zbMATH DE number 729452 (Why is no real title available?)
- scientific article; zbMATH DE number 194764 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- Introduction to numerical analysis. Transl. from the German by R. Bartels, W. Gautschi, and C. Witzgall.
- KANT V4
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- On finding the largest root of a polynomial
- On Hensel factorization. I
- On reconstruction of algebraic numbers
- Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result
- Segment LLL-reduction of lattice bases
- Segment LLL-reduction with floating point orthogonalization
Cited in
(13)- Factoring polynomials over global fields
- The complexity of computing all subfields of an algebraic number field
- Towards faster polynomial-time lattice reduction
- Galois groups over rational function fields and explicit Hilbert irreducibility
- List decoding of number field codes
- Finding integral linear dependencies of algebraic numbers and algebraic Lie algebras
- The van Hoeij algorithm for factoring polynomials
- Topics in computational algebraic number theory
- Modular Las Vegas algorithms for polynomial absolute factorization
- Computational Number Theory, Past, Present, and Future
- On the hardness of the NTRU problem
- Improved computation of polynomial roots over number fields when using complex embeddings
- Isomorphisms of algebraic number fields
This page was built for publication: A relative van Hoeij algorithm over number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643532)