- Timestamp:
- 2015-06-11T21:33:42-07:00 (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/gebauer-moeller.lisp
r1201 r1313 36 36 (in-package :gebauer-moeller) 37 37 38 (defun gebauer-moeller (ring f start &optional (top-reduction-only $poly_top_reduction_only))38 (defun gebauer-moeller (ring-and-order f start &optional (top-reduction-only $poly_top_reduction_only)) 39 39 "Compute Grobner basis by using the algorithm of Gebauer and 40 40 Moeller. This algorithm is described as BUCHBERGERNEW2 in the book by … … 42 42 that all polynomials in F are non-zero." 43 43 (declare (ignore top-reduction-only) 44 (type fixnum start)) 44 (type fixnum start) 45 (type ring-and-order ring-and-order)) 45 46 (cond 46 47 ((endp f) (return-from gebauer-moeller nil))
Note:
See TracChangeset
for help on using the changeset viewer.