Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02036353n
Noun Concept
EL
No term available
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
Relations
Sources
IS A
συνάρτηση κατακερματισμού

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