HOANG Cong Duy Vu's research logs
Saturday 16 November 2013
CMPH
Link
:
http://cmph.sourceforge.net/
Intro
: A perfect hash function maps a static set of n keys into a set of m integer numbers without collisions, where m is greater than or equal to n. If m is equal to n, the function is called minimal.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment