- Timestamp:
- 2016-06-01T17:39:06-07:00 (8 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/buchberger.lisp
r4131 r4132 22 22 (defpackage "BUCHBERGER" 23 23 (:use :cl :grobner-debug 24 : ring :polynomial :order :ring-and-order:division24 :polynomial :division 25 25 :criterion :pair-queue :priority-queue 26 26 ) … … 34 34 &optional 35 35 (start 0) 36 (top-reduction-only $poly_top_reduction_only) 37 &aux 38 (ring (ro-ring ring-and-order))) 36 (top-reduction-only $poly_top_reduction_only)) 39 37 "An implementation of the Buchberger algorithm. Return Grobner basis 40 38 of the ideal generated by the polynomial list F. Polynomials 0 to
Note:
See TracChangeset
for help on using the changeset viewer.