- Timestamp:
- 2016-06-18T19:32:07-07:00 (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/polynomial.lisp
r4552 r4553 397 397 "Non-recursive version of SLOW-ADD. This version uses auxillary variable 398 398 RESULT which serves as a stack for the terms of the sum of P and Q. This version 399 is about as fast a s SLOW-ADD, but it appears to use double the memory."399 is about as fast and consume as much memory as SLOW-ADD." 400 400 (loop 401 401 (cond
Note:
See TracChangeset
for help on using the changeset viewer.