Explicit Constructions of Perfect Hash F
β
Huaxiong Wang; Chaoping Xing
π
Article
π
2001
π
Elsevier Science
π
English
β 149 KB
Let A be a set of order n and B be a set of order m. An (n, m, w)-perfect hash family is a set H of functions from A to B such that for any X A with |X |=w, there exists an element h # H such that h is one-to-one when restricted to X. Perfect hash families have many applications to computer science,