#5519: [with patch, needs work] Irreducibility test is slow for polynomials over
GF(2)
-------------------------+--------------------------------------------------
Reporter: rhinton | Owner: rhinton
Type: enhancement | Status: new
Priority: major | Milestone:
Component: algebra | Keywords:
-------------------------+--------------------------------------------------
Comment(by rhinton):
I'm working on pseudo-random number generators. Supposedly, polynomials
with few terms (e.g. trinomials) have relatively poor properties for
PRNGs, so I think I'll stick with the NTL test for now.
malb: Why don't you like the cpdef? That allows it to be called from
Python (current usage) _and_ should make it faster if I call it from
another Cython module (possible future usage), correct? I'm new at this,
so I'm happy to learn more of the "why"s of Sage coding.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5519#comment:7>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
