Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02036353n
Noun Concept
Categories: Hashing, Hash functions, Search algorithms
EN
perfect hash function  minimal perfect hash function  minimal perfect hashing  MPHF  perfect hash
EN
In computer science, a perfect hash function h for a set S is a hash function that maps distinct elements in S to a set of m integers, with no collisions. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a perfect hash function h for a set S is a hash function that maps distinct elements in S to a set of m integers, with no collisions. Wikipedia
A set of hash functions which generate no collisions. Wikipedia Disambiguation
IS A
hash function
Wikipedia
EN
perfect hash function
Wikidata
EN
perfect hash function
Wikipedia Redirections
EN
minimal perfect hash function, minimal perfect hashing, MPHF, perfect hash, perfect hashing, Sloppy hashing

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License