New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
LatticePoset: Optimize is_simple() #25847
Milestone
Comments
Branch: u/jmantysalo/is_simple-bug |
Commit: |
New commits:
|
comment:3
LGTM. |
Reviewer: Travis Scrimshaw |
comment:4
Pathcbot failures, but they all seems to be marked with |
Changed branch from u/jmantysalo/is_simple-bug to |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Very minor heuristic.
After
P = posets.BooleanLattice(8)
compare timings ofP.congruence([[0, 1]])
andP.congruence([[0, 128]])
to understand the reason.Component: combinatorics
Author: Jori Mäntysalo
Branch/Commit:
f314a96
Reviewer: Travis Scrimshaw
Issue created by migration from https://trac.sagemath.org/ticket/25847
The text was updated successfully, but these errors were encountered: