Hello folks! Thank you, Michael, for introducing me.
To me it seems sensible, that a fast gcd implementation should consist of a bunch of algorithms and a heuristic, that chooses one of them in dependence of the input. Currently I'm working on the heuristic. I'm thinking about letting the computer do the annoying job of fine- tuning, which to me looks like a global optimization problem. Has anyone experience with simulated annealing? http://en.wikipedia.org/wiki/Simulated_annealing Curious, Achim --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
