Adding perfect and covering perfect hash families #38604
Draft
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
perfect hash families in the file hash_family.py
|
Documentation preview for this PR (built with commit 814ec6b; changes) is ready! 🎉 |
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.
This patch aims to add basic functions for perfect hash families (PHF) and covering perfect hash families (CPHF), two types of combinatorial objects that have connections to covering arrays.
This adds a function to check if an array is a PHF, one to check if an array is a CPHF and a basic construction to build PHFs.
In a following patch we would like to add methods to covering_arrays.py which take PHFs or CPHFs as input.
This fixes #38603