Polynomial factorization algorithms over number fields

DOI10.1016/J.JSC.2004.05.002zbMATH Open1137.11357OpenAlexW2092399962MaRDI QIDQ2643570FDOQ2643570

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

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

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)

Cites Work

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

Cited In (19)

• Finding small roots for bivariate polynomials over the ring of integers
• Title not available (Why is that?)
• Factorization and root-finding for polynomials over division quaternion algebras
• Newton polygons of higher order in algebraic number theory
• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Improving the algorithms of Berlekamp and Niederreiter 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
• Title not available (Why is that?)
• Intrinsic factorization of ideals in Dedekind domains

Uses Software

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

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)