"M. Edward (Ed) Borasky" <[EMAIL PROTECTED]> 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 _______________________________________________ Axiom-developer mailing list Axiom-developer@nongnu.org http://lists.nongnu.org/mailman/listinfo/axiom-developer
