#17979: Reimplementation of IntegerListsLex
-------------------------------------+-------------------------------------
Reporter: aschilling | Owner:
Type: defect | Status: needs_work
Priority: blocker | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: days64 | Merged in:
Authors: Bryan Gillespie, | Reviewers:
Anne Schilling, Nicolas M. Thiery | Work issues: support n in an
Report Upstream: N/A | iterable
Branch: | Commit:
public/ticket/17979 | 3efcb0a067bb039d28d29b3fd8c9115c18c90d15
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
By the say, sorry for my earlier comment about the `2^n` runtime of the
function. I am pretty sure I ran that test several times (reloading the
branch in between) and that it was hanging with `n=20` (running fine with
`n=10`, and slow with `n=15`), but I cannot reproduce it now and the
answer is immediate. Soooo well, my mistake `O_o`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17979#comment:86>
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.
For more options, visit https://groups.google.com/d/optout.
