𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel algorithms for Gröbner-basis construction

✍ Scribed by V. A. Mityunin; E. V. Pankratiev

Publisher
Springer US
Year
2007
Tongue
English
Weight
257 KB
Volume
142
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
✍ Ulla Koppenhagen; Ernst W. Mayr 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 642 KB

In this paper, we present an optimal, exponential space algorithm for generating the reduced Gröbner basis of binomial ideals. We make use of the close relationship between commutative semigroups and pure difference binomial ideals. Based on an optimal algorithm for the uniform word problem in commu

Ritt's algorithm, Gröbner basis and disc
Ritt's algorithm, Gröbner basis and discretization
✍ G. Calandrini; L. Castro; E. Paolini; A.C. Desages 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 773 KB

## In this paper, the application of commutative and differential algebra to system theory is presented. In particular, two alternatives for solving a continuous-time system discretization problem are described. The purpose is to obtain a discrete-time version of Flies& generalized canonical obser

Gröbner Basis Cryptosystems
Gröbner Basis Cryptosystems
✍ Peter Ackermann; Martin Kreuzer 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 256 KB
A Fast Algorithm for Gröbner Basis Conve
A Fast Algorithm for Gröbner Basis Conversion and its Applications
✍ Quoc-Nam Tran 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 362 KB

The Gröbner walk method converts a Gröbner basis by partitioning the computation of the basis into several smaller computations following a path in the Gröbner fan of the ideal generated by the system of equations. The method works with ideals of zerodimension as well as positive dimension. Typicall