Perfect Hash Families in Polynomial Time Slides October 2010 (552phf) 计算机科学

Perfect Hash Families inPolynomial TimeCharles J. ColbournPerfect Hash FamiliesPerfect Hash Families in Polynomial TimeCharles J. Colbourn11School of Computing, Informatics, and Decision Systems Engineering Arizona State UniversityOctober 2010Perfect Hash Families inPolynomial TimeCharles J. ColbournPerfect Hash FamiliesPerfect Hash Families DefinitionI A perfect hash family PHF(N; k , v , t) is an N × k array on v symbols, in which in every N × t subarray, at least one row consists of distinct