#18549: Posets: 50x faster is_incomparable_chain_free
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.8
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/posets__50x_faster_is_incomparable_chain_free|
5030de1348fcf541a97f45fea755f2f7ea7071ac
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello !
I've got no problem with the branch, but could you remove this 'TODO' from
the code and opena ticket instead?
I personally don't believe that Sage should do things like that. It should
do what it is asked to do: even if we knew what the most 'probable'
pattern is in general, we have no clue what the user's input is.
If you want some cheap speedup, here is one: you can pre-compute 'height'
and remove from the list all pairs with an element larger than 'height'.
That would 'always' work, and be rather cheap.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/18549#comment:5>
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.
