On 4 November 2016 at 14:33, 'Bill Hart' via sage-devel < [email protected]> wrote: > > There are many completely incorrect published algorithms for GCD, even in > the univariate and integer case. Dan Bernstein has a hilarious rant about > this somewhere online. It's tempting to completely ignore literature by > people who didn't implement their algorithms and test them on known hard > cases and real world examples. But just occasionally, really good ideas > turn up in papers by people who don't know how to use a computer, so this > isn't a winning strategy. >
:) Thanks for the pointers, I might end up revisiting this topic one day. My end goal was to have a reasonably fast/robust rational function class, but it seems this is still too research-y for me (and I've solved the original practical problem that prompted this detour in another way eventually). I would be interested to hear your progress in Nemo regarding this type of functionality, if you want to keep us posted here. Cheers, Francesco. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
