Login / Signup

A bound on the size of separating hash families.

Simon R. BlackburnTuvi EtzionDouglas R. StinsonGregory M. Zaverucha
Published in: J. Comb. Theory, Ser. A (2008)
Keyphrases
  • upper bound
  • data sets
  • information systems
  • case study
  • lower bound
  • real world
  • worst case
  • maximum number
  • small size
  • constant factor
  • linear functions