A relative van Hoeij algorithm over number fields
type: Item
instance of: scholarly article
title: A relative van Hoeij algorithm over number fields
zbMATH Open document ID: 1137.11360
author: Karim Belabas
published in: Journal of Symbolic Computation
publication date: 2007-08-24T00:00:00Z
Mathematics Subject Classification ID: 11Y40
zbMATH DE Number: 5182690
zbMATH Keywords: polynomial factorization
zbMATH Keywords: number fields
describes a project that uses: NTL
describes a project that uses: KANT/KASH
MaRDI profile type: MaRDI publication profile
full work available at URL: j.jsc.2003.09.003
OpenAlex ID: W1963728823
cites work: Factorization in Z[x]
cites work: An efficient algorithm for the computation of Galois automorphisms
cites work: Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result
cites work: Factoring Polynomials Over Large Finite Fields
cites work: Approximating rings of integers in number fields
cites work: Computing the measure of a polynomial
cites work: Q3139838
cites work: KANT V4
cites work: On finding the largest root of a polynomial
cites work: Q2739450
cites work: A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
cites work: Q5653524
cites work: Q5585020
cites work: Q4787200
cites work: Q4787201
cites work: Q3327715
cites work: Factoring polynomials with rational coefficients
cites work: An Inequality About Factors of Polynomials
cites work: Q3714149
cites work: Q4324957
cites work: Q4692759
cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
cites work: Q4779819
cites work: Factoring polynomials and the knapsack problem
cites work: On Hensel factorization. I
DOI: 10.1016/J.JSC.2003.09.003
description: scientific article; zbMATH DE number 5182690