A relative van Hoeij algorithm over number fields

DOI10.1016/J.JSC.2003.09.003MaRDI QIDQ2643532zbMATHOpenAlexFDO

Authors Karim Belabas

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

zbMATH Keywords

number fieldspolynomial factorization

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40)

Recommendations

• The van Hoeij algorithm for factoring polynomials
• Factoring polynomials over global fields
• scientific article; zbMATH DE number 3906595
• scientific article; zbMATH DE number 3860385
• Factoring Multivariate Polynomials over Algebraic Number Fields

Cites work

• scientific article; zbMATH DE number 1643932 (Why is no real title available?)
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3860385 (Why is no real title available?)
• scientific article; zbMATH DE number 3941638 (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 1821102 (Why is no real title available?)
• scientific article; zbMATH DE number 1852137 (Why is no real title available?)
• scientific article; zbMATH DE number 1852138 (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?)
• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• An Inequality About Factors of Polynomials
• An efficient algorithm for the computation of Galois automorphisms
• Approximating rings of integers in number fields
• Computing the measure of a polynomial
• Factoring Polynomials Over Large Finite Fields
• Factoring polynomials and the knapsack problem
• Factoring polynomials with rational coefficients
• Factorization in Z[x]
• KANT V4
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• On Hensel factorization. I
• On finding the largest root of a polynomial
• Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result

Cited in

(13)

• Improved computation of polynomial roots over number fields when using complex embeddings
• Topics in computational algebraic number theory
• Towards faster polynomial-time lattice reduction
• Finding integral linear dependencies of algebraic numbers and algebraic Lie algebras
• Computational Number Theory, Past, Present, and Future
• Factoring polynomials over global fields
• Galois groups over rational function fields and explicit Hilbert irreducibility
• The complexity of computing all subfields of an algebraic number field
• The van Hoeij algorithm for factoring polynomials
• Modular Las Vegas algorithms for polynomial absolute factorization
• Isomorphisms of algebraic number fields
• On the hardness of the NTRU problem
• List decoding of number field codes

Describes a project that uses

Uses Software

• KANT/KASH
• NTL

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)