Polynomial factorization algorithms over number fields

DOI10.1016/j.jsc.2004.05.002zbMath1137.11357OpenAlexW2092399962MaRDI QIDQ2643570

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

Related Items (1)

Factorization and root-finding for polynomials over division quaternion algebras

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials and the knapsack problem
• Solvability by radicals is in polynomial time
• Computing the decomposition of primes p and p-adic absolute values in semi-simple algebras over \({\mathbb{Q}}\)
• The construction of maximal orders over a Dedekind domain
• Factoring polynomials with rational coefficients
• Implementing the Round Four maximal order algorithm
• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• An Inequality About Factors of Polynomials
• Factoring Polynomials Over Algebraic Number Fields
• Computing ray class groups, conductors and discriminants
• Factoring Polynomials Over Large Finite Fields

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