Displaying similar documents to “The F4-algorithm for Euclidean rings”

Towards the automated synthesis of a Gröbner bases algorithm.

Bruno Buchberger (2004)

RACSAM

Similarity:

We discuss the question of whether the central result of algorithmic Gröbner bases theory, namely the notion of S?polynomials together with the algorithm for constructing Gröbner bases using S?polynomials, can be obtained by ?artificial intelligence?, i.e. a systematic (algorithmic) algorithm synthesis method. We present the ?lazy thinking? method for theorem and algorithm invention and apply it to the ?critical pair / completion? algorithm scheme. We present a road map that demonstrates...

An algorithm for primary decomposition in polynomial rings over the integers

Gerhard Pfister, Afshan Sadiq, Stefan Steidel (2011)

Open Mathematics

Similarity:

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 polynomial rings over the rationals, resp. over finite fields, and the idea of Shimoyama-Yokoyama, resp. Eisenbud-Hunecke-Vasconcelos, to extract primary ideals from pseudo-primary ideals. A parallelized version of the algorithm is implemented in Singular. Examples and timings are given at the end of the article. ...

Topics in computational algebraic number theory

Karim Belabas (2004)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We describe practical algorithms from computational algebraic number theory, with applications to class field theory. These include basic arithmetic, approximation and uniformizers, discrete logarithms and computation of class fields. All algorithms have been implemented in the system.