Polynomial factorization algorithms over number fields

DOI10.1016/J.JSC.2004.05.002MaRDI QIDQ2643570zbMATH OpenOpenAlexFDO

Authors Xavier-François Roblot

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.2004.05.002

zbMATH Keywords

number fieldsfactorization algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Polynomials, factorization in commutative rings (13P05) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 3858405
• scientific article; zbMATH DE number 4069018
• scientific article; zbMATH DE number 1276815
• Factorization of Prime Ideal Extensions in Number Rings
• Factoring polynomials over finite 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 3991629 (Why is no real title available?)
• scientific article; zbMATH DE number 3785004 (Why is no real title available?)
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• scientific article; zbMATH DE number 192896 (Why is no real title available?)
• scientific article; zbMATH DE number 1254235 (Why is no real title available?)
• scientific article; zbMATH DE number 194764 (Why is no real title available?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• An Inequality About Factors of Polynomials
• Computing ray class groups, conductors and discriminants
• Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\)
• Factoring Polynomials Over Algebraic Number Fields
• Factoring Polynomials Over Large Finite Fields
• Factoring polynomials and the knapsack problem
• Factoring polynomials with rational coefficients
• Implementing the Round Four maximal order algorithm
• Solvability by radicals is in polynomial time
• The construction of maximal orders over a Dedekind domain

Cited in

(19)

• Intrinsic factorization of ideals in Dedekind domains
• Finding small roots for bivariate polynomials over the ring of integers
• scientific article; zbMATH DE number 2162228 (Why is no real title available?)
• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• Newton polygons of higher order in algebraic number theory
• Factorization and root-finding for polynomials over division quaternion algebras
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Practical polynomial factoring in polynomial time
• A new efficient factorization algorithm for polynomials over small finite fields
• Factoring polynomials over global fields
• Modular Las Vegas algorithms for polynomial absolute factorization
• On a New Factorization Algorithm for Polynomials Over Finite Fields
• Algorithms for polynomial GCD computation over algebraic function fields
• Factorization of Prime Ideal Extensions in Number Rings
• Factoring polynomials using binary representations of finite fields
• Improved computation of polynomial roots over number fields when using complex embeddings
• scientific article; zbMATH DE number 3968702 (Why is no real title available?)

Describes a project that uses

Uses Software

• SIMATH
• PARI/GP
• Magma
• KANT/KASH

This page was built for publication: Polynomial factorization algorithms over number fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643570)