I don't think you want to them as doctests, they take dozens of minutes to run! (That is, for the cached rings which take 10000 times longer to compute.) Ideally this issue can be fixed, but I'm not sure how...
- Robert On May 28, 2007, at 4:35 PM, Nick Alexander wrote: > Robert Bradshaw <[EMAIL PROTECTED]> writes: > >> I'm kind of late jumping into this thread, but I have some concerns. >> Unless the factorization is known completely (or gcd's are taken on >> the unknown part), I still think this can lead to combinatorial >> explosion fairly quickly. For example, > > Michel and I are working through the refereeing process. I will try > to take your examples into account, and have them as doctests. Please > ping me again if these troubles remain after the patch is applied. > > Nick > > --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] 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/ -~----------~----~----~----~------~----~------~--~---
