#21109: Faster meet() for lattice
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_work
Priority: minor | Milestone: sage-7.3
Component: combinatorics | Resolution:
Keywords: lattice poset | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: u/jmantysalo | Commit:
/faster-meet | b679b3ddc7f7e1552a098ee5b231d5e3eeff4249
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jmantysalo):
Replying to [comment:4 tscrim]:
> Have you run tests on smaller and larger lattices? Does the about 2x
speedup still hold in those cases?
It is very hard to think an example where my code would be slower. This
references to a python dict, whereas current code references to a matrix;
referencing to matrix elements in a loop is slow. And that matrix must be
precomputed first. You can test what happens if you compute le-matrix
first (assuming that the user has, say, computed Möbius function matrix),
but there will still be speedup.
I added another example to description.
--
Ticket URL: <https://trac.sagemath.org/ticket/21109#comment:7>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
