- Timestamp:
- 2015-06-15T18:26:58-07:00 (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/buchberger.lisp
r1919 r1920 47 47 reduction will be preformed. This function assumes that all polynomials 48 48 in F are non-zero." 49 (declare (type fixnum start) (type ring ring))49 (declare (type fixnum start) (type ring-and-order ring-and-order)) 50 50 (when (endp f) (return-from buchberger f)) ;cut startup costs 51 51 (debug-cgb "~&GROBNER BASIS - BUCHBERGER ALGORITHM")
Note:
See TracChangeset
for help on using the changeset viewer.