- Timestamp:
- 2015-06-11T21:59:40-07:00 (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/5am-tests.lisp
r1328 r1336 266 266 (is (equalp (gebauer-moeller ring-and-order fl) gb)))) 267 267 268 (test gb-postprocessing 269 "Gebauer-Moeller algorithm" 270 (let* ((fl (cdr (string->poly "[x+y,x-2*y]" '(x y)))) 271 (ring *ring-of-integers*) 272 (order #'lex>) 273 (ring-and-order (make-ring-and-order :ring ring :order order)) 274 (gb (cdr (string->poly "[y,x-2*y]" '(x y))))) 275 (is-true (grobner-test ring-and-order gb fl)) 276 (is (equalp (gebauer-moeller ring-and-order fl) gb)))) 277 268 278 269 279 (run! 'ngrobner-suite)
Note:
See TracChangeset
for help on using the changeset viewer.