initial benchmarks to try verifying O(2^k * n) for graph coloring #20
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
jpfairbanks
reviewed
Oct 25, 2024
| #for each leg lᵢ : p → xᵢ of the pullback cone, | ||
| #compute its image ιᵢ : im lᵢ → dxᵢ | ||
| imgs = map( f -> legs(image(f))[1], p_legs) | ||
| #now get the new desired cospan; |
There was a problem hiding this comment.
make sure these comments end up back in the code.
There was a problem hiding this comment.
comments are back in the code
old versions of the functions are still in the DecidingSheaves file under old_(function name)
|
@andersenwall, you have permission from @samuelsonric to replace the failing test with a check that the lengths are equal |
resolved, test cases should all pass now |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
initial benchmarks complete for constant 2 bags with n nodes.
verified n linear for false returns on coloring tests
problem found with n worse than exponential for true returns on coloring tests