[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Axiom-developer] Re: AMS Notices: Open Source Mathematical Software

From: Gabriel Dos Reis
Subject: Re: [Axiom-developer] Re: AMS Notices: Open Source Mathematical Software
Date: 26 Nov 2007 23:01:56 -0600

"M. Edward (Ed) Borasky" <address@hidden> writes:


| > Suppose someone creates a
| > closed, commercial, really fast Groebner basis algorithm, does not
| > publish the details, and then the code dies. It can happen. Macsyma
| > had some of the best algorithms and they are lost.
| 1. What do you think the real chances are of a "really fast Groebner
| basis algorithm" are? I'm by no means an expert, but I thought the
| computational complexity odds were heavily stacked against one.

Indeed.  There is an inherent complexity issue.  So what people do is
to optimize for certain classes of systems.  So, I don't know what
"really fast Groebner basis algorithm" could possibly mean.

-- Gaby

reply via email to

[Prev in Thread] Current Thread [Next in Thread]