On Jan 4, 2007, at 6:57 PM, William Stein wrote:
On Thu, 04 Jan 2007 15:43:53 -0800, David Harvey
<[EMAIL PROTECTED]> wrote:
(a). This is my own personal bias, because I can see step-by-step
how it could bedone; it is straightforward. PARI integration
sounds much harder. For a startit's not even clear to me how we
would be representing data. PARI already hasits own data
structure for representing polynomials.
I'm not sure what Bill Hart had in mind, but the following (below)
is what I have in mind when I imagine PARI/Flint integration.
[....]
OK, so basically you're saying, find the part of PARI that gets
called whenever polynomials need to be multiplied, add a line like
"if (size > 42) ..." which converts to FLINT format, runs the
multiplication, and converts back to PARI format. So the integration
you have in mind is not all that tight. I guess this would be doable,
and I agree it shouldn't be too difficult.
David
--~--~---------~--~----~------------~-------~--~----~
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/
-~----------~----~----~----~------~----~------~--~---
