#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 zimmerma):
> Paul, does GF2X also have a is_primitive() function of some sorts?
not directly, but the factor.cpp program searches for the smaller factor
(in terms of degree)
of x^r + x^s + 1, it can be used as a starting point for a general
irreducibility test.
Paul
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5519#comment:6>
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
-~----------~----~----~----~------~----~------~--~---
