Oh, just another note. There are people who have made their whole careers on devising asymptotically fast algorithms which have never been implemented, or (if they have been implemented) are not fast because their overly-simplified analysis does not fit the currently available computer efficiency profile. Indeed, their analysis may not fit any past profile of computers, and their algorithms were never practical.
Note, for example, that memory access is far more expensive than arithmetic, and that many computers now can multiply or add in comparable time; and they have several multipliers. Etc. RJF -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
