| 
|
Quote: floor(C/Dw+E) mod n is a minimal perfect hash function of any set of n w's
topics >
all references >
references i-l >
Topic:
perfect hash table
Quotation Skeleton
THEOREM. Given a finite set W = {w1, … , wn} of positive integers, there exist three … ) mod n is a minimal perfect hash … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: perfect hash table (9 items)