The question is, which algorithm does SAGE currently use? Does it really provide a proven result? Is it proven to terminate? Can it provide a certificate that I can check in less time than doing the computation again? How can I be sure the result is valid?
Anyhow, whatever algorithm or level of rigour is used, it is clear we need to make it *much* faster. That's the problem I'm most interested in of course. Bill. --~--~---------~--~----~------------~-------~--~----~ 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://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
