Testbed for exploring dynamic algorithms to compute a Groebner basis
-
Updated
Feb 13, 2021 - C++
Testbed for exploring dynamic algorithms to compute a Groebner basis
c++ library for mathematical computations
Implemented primitives for working with ideals of polynomial rings of several variables and algorithms for finding various Groebner bases.
A fast program for computing Groebner bases
Add a description, image, and links to the groebner-bases topic page so that developers can more easily learn about it.
To associate your repository with the groebner-bases topic, visit your repo's landing page and select "manage topics."