Subject: many applications for bigger than 2^31 exponents
From: Richard Fateman
Date: Wed, 14 Feb 2007 09:40:34 -0800
Oh, just to illustrate... The Grobner basis computation program written by
Spear and Zacharias for Macsyma does polynomial arithmetic and could use CRE
form. It doesn't. A whole different polynomial arithmetic system was
written with a view toward more efficient computation for GB. If we wanted
to have a much better GB system, we could attach some other program, not
even written in Lisp. E.g. if Faugere were to make his program available to
us, or perhaps to link to Singular or ...
RJF
> -----Original Message-----
> From: maxima-bounces at math.utexas.edu [mailto:maxima-
> bounces at math.utexas.edu] On Behalf Of Richard Fateman
> Sent: Wednesday, February 14, 2007 9:19 AM
> To: 'Fabrizio Caruso'; maxima at math.utexas.edu
> Subject: Re: [Maxima] many applications for bigger than 2^31 exponents
>
> While it is nice for maxima to be used for many different applications, it
> may be appropriate to consider writing special code for your applications
> so
> that it can be used for huge exponents. Assuming that everyone else's
> computations should be slowed down so that the same program can be used
> for
> (slowly) solving certain problems in coding theory does not necessarily
> make
> sense. Especially if there are small self-contained efficient programs
> that
> are specifically tailored to the coding theory problems.
>
> RJF
>