- Timestamp:
- 2015-06-11T21:34:59-07:00 (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/gebauer-moeller.lisp
r1313 r1314 36 36 (in-package :gebauer-moeller) 37 37 38 (defun gebauer-moeller (ring-and-order f start &optional (top-reduction-only $poly_top_reduction_only)) 38 (defun gebauer-moeller (ring-and-order f 39 &optional 40 (start 0) 41 (top-reduction-only $poly_top_reduction_only) 42 &aux 43 (ring (ro-ring ring-and-order)) 39 44 "Compute Grobner basis by using the algorithm of Gebauer and 40 45 Moeller. This algorithm is described as BUCHBERGERNEW2 in the book by
Note:
See TracChangeset
for help on using the changeset viewer.