We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5581734 commit 04498bdCopy full SHA for 04498bd
docs/src/groebner-bases.md
@@ -17,9 +17,9 @@ Pages = ["groebner-bases.md"]
17
18
## Introduction
19
20
-AlgebraicSolving allows to compute Gröbner bases for input generators over finite
21
-fields of characteristic smaller $2^{31}$ w.r.t. the degree reverse
22
-lexicographical monomial order.
+AlgebraicSolving allows to compute Gröbner bases for input generators over prime
+fields of characteristic smaller $2^{31}$ or over the rationals w.r.t. the degree
+reverse lexicographical monomial order.
23
24
At the moment different variants of Faugère's F4 Algorithm are implemented as
25
well as a signature based algorithm to compute Gröbner bases.
0 commit comments