Le 26/09/2014 16:47, Jeroen Demeyer a écrit :
On 2014-09-26 16:25, Peter Bruin wrote:
It would be a different
story if there were a significantly faster algorithm than to call
ispower() and ispseudoprime(), but that would first need to be
demonstrated.
But why does that even matter? You agreed that the complexity of the
implementation is a bad metric. And it's not because we cannot think of
a more efficient algorithm right now that one won't be found tomorrow.
Well, I suggest following Peter's idea of a two-lines function *in
sagelib* instead of forking sage for such a dubious reason. If a more
efficient algorithm is found tomorrow, I'm pretty sure PARI's developers
will change their minds!
Snark on #sagemath
--
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 sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
