#14094: Iterating through Partitions(n) for n>=1000.
---------------------------------+------------------------------------------
Reporter: nthiery | Owner: sage-combinat
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.7
Component: combinatorics | Resolution:
Keywords: days45 | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Mike Hansen | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Changes (by {'newvalue': u'Mike Hansen', 'oldvalue': ''}):
* status: new => needs_review
* author: => Mike Hansen
Comment:
I implemented the algorithm found at http://www.site.uottawa.ca/~ivan/F49
-int-part.pdf
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14094#comment:1>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
