On 9/6/07, Bill Hart <[EMAIL PROTECTED]> wrote: > The question is, which algorithm does SAGE currently use?
For class groups? If so, it uses pari, then calls the bnfcertify command after doing the computation. > Does it > really provide a proven result? Assuming pari works correctly. > Is it proven to terminate? I don't know. > Can it > provide a certificate that I can check in less time than doing the > computation again? I don't know. > How can I be sure the result is valid? You can't really. > 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. That's the spirit! William --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
