#5519: Irreducibility test is slow for polynomials over GF(2)
-------------------------+--------------------------------------------------
Reporter: rhinton | Owner: rhinton
Type: enhancement | Status: new
Priority: major | Milestone:
Component: algebra | Keywords:
-------------------------+--------------------------------------------------
The patch calls the NTL irreducibility test directly instead of depending
on a generic algorithm. It's not blazingly fast (e.g. Magma), but it's an
improvement.
R.<x> = GF(2)[]
timeit('R.random_element(100).is_irreducible()')
# before the change
# 25 loops, best of 3: 16.2 ms per loop
# after the change
# 25 loops, best of 3: 3.36 ms per loop
timeit('R.random_element(512).is_irreducible()')
# before the change
# 5 loops, best of 3: 323 ms per loop
# after the change
# 25 loops, best of 3: 18.7 ms per loop
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5519>
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
-~----------~----~----~----~------~----~------~--~---
