#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: Nathann Cohen, Jeroen
Anne Schilling, Nicolas M. Thiery | Demeyer
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/ticket/17979 | 4bcf7dc9ee28539f166c14f973f26401ceb39de3
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by nthiery):
Replying to [comment:190 jdemeyer]:
> I would also prefer to remove the text concerning algorithmic complexity
in `src/sage/combinat/tutorial.py`. What I dislike most is that it seems
to hide behind the "degenerate cases" exception without really specifying
what that means.
Well, defining precisely the "degenerate cases" is a little research
project by itself :-) But the point is that, in most practical use
cases, the complexity is low (or will be low once an improved
lookahead will be implemented #18055). I am happy to reformulate it
this way if you prefer. But I'd rather keep some short sentence about
this topic here, as it explains the rationale of the approach to the
reader.
--
Ticket URL: <http://trac.sagemath.org/ticket/17979#comment:209>
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.
