48 citations · 73 across the 5 of their papers we have counts for
4 papers · 1 filter
Efficient Gröbner Bases Computation over Principal Ideal Rings
Christian Eder, Tommy Hofmann
In this paper we present a new efficient variant to compute strong Gröbner basis over quotients of principal ideal domains. We show an easy lifting process which allows us to reduc…
Standard Bases over Euclidean Domains
Christian Eder, Gerhard Pfister, Adrian Popescu
In this paper we state and explain techniques useful for the computation of strong Gröbner and standard bases over Euclidean domains: First we investigate several strategies for cr…
Signature-based algorithms to compute Groebner bases
Christian Eder, John Perry
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three r…
On The Criteria Of The F5 Algorithm
Christian Eder
Faugere's F5 algorithm is one of the fastest known algorithms for the computation of Grobner bases. So far only the F5 Criterion is proved, whereas the second powerful criterion, t…