26 citations · 77 across the 6 of their papers we have counts for
6 papers
Solving via modular methods
Deeba Afzal, Faira Kanwal, Gerhard Pfister +1
In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals.…
Groebner bases of symmetric ideals
Stefan Steidel
In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implem…
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…
About the computation of the signature of surface singularities z^N+g(x,y)=0
Muhammad Ahsan Banyamin, Gerhard Pfister, Stefan Steidel
In this article we describe our experiences with a parallel SINGULAR-implementation of the signature of a surface singularity defined by z^N+g(x,y)=0.
An algorithm for primary decomposition in polynomial rings over the integers
Gerhard Pfister, Afshan Sadiq, Stefan Steidel
We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polyn…
Parallelization of Modular Algorithms
Nazeran Idrees, Gerhard Pfister, Stefan Steidel
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gröbner bases (resp. standard bases) and the modular com…