#7580: bugs in infinite polynomial ring
-----------------------+----------------------------------------------------
Reporter: was | Owner: SimonKing
Type: defect | Status: needs_review
Priority: major | Milestone: sage-4.3
Component: algebra | Keywords: infinite polynomial ring coercion
Work_issues: | Author: Simon King
Upstream: N/A | Reviewer:
Merged: |
-----------------------+----------------------------------------------------
Comment(by SimonKing):
Replying to [comment:11 was]:
> {{{
> The bugs in your code can really sting.
> But the speed will really zing!
> }}}
:)
If there is a speed improvement then it is very likely due to the recent
improvements of conversions in {{{MPolynomialRing_libsingular}}} (in that
case I don't use sage_eval) and in
{{{MPolynomial_libsingular.exponent()}}} (I use regular expressions to
determine the exponents only if {{{MPolynomial_polydict}}} occurs).
And if there are bugs -- well, of course there are (as in any non-trivial
program), but I did my best to hide them.
Cheers,
Simon
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7580#comment:12>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
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-trac?hl=en.
