Practical Groebner Basis Computation
Symbolic Computation
2012-07-02 v1 Data Structures and Algorithms
Commutative Algebra
Abstract
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature based Groebner basis algorithms and more traditional variations of the classic Buchberger algorithm. Our conclusions are based on experiments using our new freely available open source standalone C++ library.
Keywords
Cite
@article{arxiv.1206.6940,
title = {Practical Groebner Basis Computation},
author = {Bjarke Hammersholt Roune and Michael Stillman},
journal= {arXiv preprint arXiv:1206.6940},
year = {2012}
}
Comments
Full online version including appendices, 17 pages; Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2012