- Timestamp:
- 2015-06-11T22:36:00-07:00 (10 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/f4grobner/5am-tests.lisp
r1364 r1365 281 281 (is (equalp (minimization gb) minimal-gb)))) 282 282 283 (test grobner-wrap 284 "Gebauer-Moeller algorithm" 285 (let* ((fl (cdr (string->poly "[x+y,x-2*y]" '(x y)))) 286 (ring *ring-of-integers*) 287 (order #'lex>) 288 (ring-and-order (make-ring-and-order :ring ring :order order)) 289 (gb (cdr (string->poly "[y,x-2*y]" '(x y))))) 290 (is-true (grobner-test ring-and-order gb fl)) 291 (is (equalp (grobner ring-and-order fl) gb)))) 292 283 293 284 294 (run! 'ngrobner-suite)
Note:
See TracChangeset
for help on using the changeset viewer.