11 citations · 15 across the 5 of their papers we have counts for
5 papers
A Direttissimo Algorithm for Equidimensional Decomposition
Christian Eder, Pierre Lairez, Rafael Mohr +1
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension.…
New Strategies for Standard Bases over Z
Christian Eder, Gerhard Pfister, Adrian Popescu
Experiences with the implementation of strong Gröbner bases respectively standard bases for polynomial rings over principal ideal rings are explained: different strategies for crea…
A survey on signature-based Gröbner basis computations
Christian Eder, Jean-Charles Faugère
This paper is a survey on the area of signature-based Gröbner basis algorithms that was initiated by Faugère's F5 algorithm in 2002. We explain the general ideas behind the usage o…
Predicting zero reductions in Gröbner basis computations
Christian Eder
Since Buchberger's initial algorithm for computing Gröbner bases in 1965 many attempts have been taken to detect zero reductions in advance. Buchberger's Product and Chain criteria…
An analysis of inhomogeneous signature-based Gröbner basis computations
Christian Eder
In this paper we give an insight into the behaviour of signature-based Gröbner basis algorithms, like F5, G2V or SB, for inhomogeneous input. On the one hand, it seems that the res…