#1145: high-level strategy for integer factorization
---------------------------+------------------------------------------------
Reporter: zimmerma | Owner: aapitzsch
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-wishlist
Component: factorization | Resolution:
Keywords: | Author:
Upstream: N/A | Reviewer:
Merged: | Work_issues:
---------------------------+------------------------------------------------
Comment(by robertwb):
+1 to moving all the code to a new factor module. I've just very briefly
looked at your code. Also, in terms of code structure, there's no need for
all the functions to start with an underscore, and it's probably worth
making them cpdef functions for ease of testing. (There's no overhead for
module-level methods, as they can't be overridden, so the cdef portion is
just as fast.) How does sympy.factorint compare to, say, pari's sieves?
What about the quadratic sieve from flint?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/1145#comment:15>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
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.
