#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 malb):
Hi Minh,
my system is a 2.33 Ghz Core2Duo running 64-bit Debian/squeeze.
Note that you mixed up the units in your calculation. {{{1.14}}} seconds
are {{{1.14 * 10^6^}}} microseconds not {{{1.14 * 10^3^}}}, i.e. you're
mixing it up with milliseconds.
http://en.wikipedia.org/wiki/Orders_of_magnitude_(time)
So you need to add a factor of 1000.
For {{{d=10000}}} it seems even more:
{{{
4974.95 * 10^6 / 930
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5519#comment:16>
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
-~----------~----~----~----~------~----~------~--~---
