Changes between Version 2 and Version 3 of WikiStart


Ignore:
Timestamp:
Jan 25, 2009, 8:25:03 PM (9 years ago)
Author:
marek
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • WikiStart

    v2 v3  
    1212 * It implements several different algorithms.
    1313
    14 The package is not particularly fast, which is the cost of its great flexibility. However, it can be optimized in many ways by a programmer proficient in Common Lisp.
     14The package is not particularly fast, which is the cost of its great flexibility. The algorithm is not particularly new, either. It is based on the original work of Buchberger, and more recent work of Gebauer and Moeller, and the "sugar" algorithm of A. Giovini, T. Mora, G. Niesi, L. Robbiano and C. Traverso. The more recent work of Faugere is not reflected in the code, as of today.
     15
     16On the software level, the package can be optimized in many ways by a programmer proficient in Common Lisp. The optimization of Lisp code consists in careful inlining and adding declarations if the data types of certain variables can be known in advance. It is a mundane process, and due to this cost, one must be motivated by a problem at hand. However, the speedup may be significant. The source code provides no such optimizations, so that the same source code can work with the widest class of coefficient rings.
     17
    1518
    1619Enjoy! [[BR]]