#18547: Improve polynomial powering in positive characteristic
-------------------------------------+-------------------------------------
Reporter: bruno | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.8
Component: commutative | Resolution:
algebra | Merged in:
Keywords: polynomial, | Reviewers:
powering | Work issues:
Authors: Bruno Grenet | Commit:
Report Upstream: N/A | 959947d37b22e0c806e5e2034760abdc10d967b6
Branch: | Stopgaps:
u/bruno/polynomial_powering_positive_characteristic|
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by jdemeyer):
I think this test is much too weak:
{{{
sage: R.<x> = PolynomialRing(GF(17), sparse=True)
sage: for d in [17, 264, 516]:
....: assert((1+x)^d == generic_power(1+x,d))
}}}
(but I'll wait to suggest a better test until I understand the code
better).
--
Ticket URL: <http://trac.sagemath.org/ticket/18547#comment:17>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
