55 citations · 152 across the 16 of their papers we have counts for
4 papers · 1 filter
Computing integral bases via localization and Hensel lifting
Janko Boehm, Wolfram Decker, Santiago Laplagne +1
We present a new algorithm for computing integral bases in algebraic function fields of one variable, or equivalently for constructing the normalization of a plane curve. Our basic…
Gröbner Bases over Algebraic Number Fields
Dereje Kifle Boku, Claus Fieker, Wolfram Decker +1
Although Buchberger's algorithm, in theory, allows us to compute Gröbner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the g…
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…
Parallel algorithms for normalization
Janko Boehm, Wolfram Decker, Santiago Laplagne +3
Given a reduced affine algebra A over a perfect field K, we present parallel algorithms to compute the normalization \bar{A} of A. Our starting point is the algorithm of Greuel, La…