Polynomial factorization algorithms over number fields
From MaRDI portal
Publication:2643570
DOI10.1016/j.jsc.2004.05.002zbMath1137.11357OpenAlexW2092399962MaRDI QIDQ2643570
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
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