- Timestamp:
- 2016-06-04T22:40:20-07:00 (8 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/division.lisp
r4211 r4310 93 93 ;; Loop invariant: c*f=sum ai*fi+r+p, where p must eventually become 0 94 94 (do ((r (make-zero-for f)) 95 (c 1)95 (c (make-unit-for (leading-coefficient f))) 96 96 (a (make-list (length fl) :initial-element (make-zero-for f))) 97 97 (division-count 0)
Note:
See TracChangeset
for help on using the changeset viewer.