Gröbner bases of ideals of polynomials are known to have many applications. They have been applied to problems in commutative algebra, statistics, graph theory, robotics and differential equations. Their use as a research tool, however, is limited by their computational complexity. These two facts h
✦ LIBER ✦
A Machine-Checked Implementation of Buchberger's Algorithm
✍ Scribed by Laurent Théry
- Book ID
- 111564193
- Publisher
- Springer Netherlands
- Year
- 2001
- Tongue
- English
- Weight
- 157 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0168-7433
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A Parallel Implementation of Buchberger'
✍
A.A. Reeves
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 391 KB
A MIMD implementation of the Buchberger
✍
P. Senechaud
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 413 KB
Senechaud, P\_, A MIMD implementation of the Buchberger algorithm for Boolean polynomials, Parallel Computing 17 (1991) 29-37\_ In this note we present two methods to compute GriSbner basis in parallel, both based on Buchberger's sequential algorithm. A distributed memory MIMD computer (the FPS T40
An implementation of buchbergers' algori
✍
C.M Kalker-Kalkman
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 723 KB
A Variant of the Buchberger Algorithm fo
✍
Urbaniak, Regina; Weismantel, Robert; Ziegler, Günter M.
📂
Article
📅
1997
🏛
Society for Industrial and Applied Mathematics
🌐
English
⚖ 284 KB
Holographic implementation of a learning
✍
Paek, Eung Gi; Wullert II, John R.; Patel, J. S.
📂
Article
📅
1989
🏛
Optical Society of America
🌐
English
⚖ 441 KB
A computer checked algebraic verificatio
✍
Jan Friso Groote; François Monin; Jan Springintveld
📂
Article
📅
2005
🏛
Springer
🌐
English
⚖ 217 KB