Last change
on this file since 1 was 1, checked in by Marek Rychlik, 15 years ago |
First import of a version circa 1997.
|
File size:
489 bytes
|
Rev | Line | |
---|
[1] | 1 | # $Id: TODO,v 1.4 1997/10/25 18:06:11 marek Exp $
|
---|
| 2 | -*- Mode: outline; fill-column: 50 -*-
|
---|
| 3 |
|
---|
| 4 | ** Implement ordered polynomial lists
|
---|
| 5 |
|
---|
| 6 | Polynomial lists should be stored as ordered
|
---|
| 7 | lists, ordered according to the increasing leading
|
---|
| 8 | monomial; this should speed up operations like
|
---|
| 9 | division etc. This is because if a monomial a
|
---|
| 10 | divides b then a<b in any compatible order; thus
|
---|
| 11 | in the division algorithm we may simply stop when
|
---|
| 12 | we find the first leading monomial which is
|
---|
| 13 | greater than the dividend;
|
---|
Note:
See
TracBrowser
for help on using the repository browser.