> case where you evaluate for example a polynomial (or rational > function) with a large number of terms > on fractions. And actually if you have a slow gcd algorithm you don't need a large number of terms before things become really very slow. Michel --~--~---------~--~----~------------~-------~--~----~ 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/ -~----------~----~----~----~------~----~------~--~---
- [sage-devel] Re: New implementation of fraction fields Michel
- [sage-devel] Re: New implementation of fraction fiel... David Harvey
- [sage-devel] Re: New implementation of fraction ... Nick Alexander
- [sage-devel] Re: New implementation of fract... Michel
- [sage-devel] Re: New implementation of f... David Harvey
- [sage-devel] Re: New implementation... Michel
- [sage-devel] Re: New implementa... David Harvey
- [sage-devel] Re: New implementation... Justin C. Walker
- [sage-devel] Re: New implementation of fraction ... Michel
- [sage-devel] Re: New implementation of fraction ... Justin C. Walker
- [sage-devel] Re: New implementation of fraction fiel... Nick Alexander
