60 citations · 141 across the 17 of their papers we have counts for
4 papers · 1 filter
Computation of Galois groups of rational polynomials
Claus Fieker, Jürgen Klüners
Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Staudu…
The use of Bad Primes in Rational Reconstruction
Janko Boehm, Wolfram Decker, Claus Fieker +1
A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, a…
A polynomial time algorithm for computing the HNF of a module over the integers of a number field
Jean-François Biasse, Claus Fieker
We present a variation of the modular algorithm for computing the Hermite Normal Form of an $\OK$-module presented by Cohen, where $\OK$ is the ring of integers of a number field K…
New techniques for computing the ideal class group and a system of fundamental units in number fields
Jean-François Biasse, Claus Fieker
We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use s…