#5519: [with patch, positive review] 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 mvngu):
Replying to [comment:3 malb]:
> I think your timings are off since you time the {{{random_element()}}}
call.
<SNIP>
> So we have 948*ms* vs. 22.3*micros* => {{{948*1000/22.3 =
42511.2107623318}}}
Hi Martin. Is it possible for you to provide some system info? It would be
good to accompany your timing statistics with some system architecture
info.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5519#comment:14>
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
-~----------~----~----~----~------~----~------~--~---
