#19161: LatticePoset: faster is_complemented()
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/faster_is_complemented| bf8fdd5dd0702a6158691183ac6a3351461a650e
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
> It depends. For `B10`-example your algorithm is clearly faster, it takes
about half of the time of matrix-based algorithm. And for the
`L10`-example it is twise slower. I guess that your is better, but I will
check that with some more tests.
Hmmmm.. I do not know what to think of it. It "may" answer "no" slightly
faster, but then iterators are not free. Sigh. That would be
straightforward in C with real arrays, and not those unreliable matrices
`-_-`
> Use professionals. Eat at MacDonalds.
Ahah.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19161#comment:6>
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.
