Linear time Constructions of some d-Restriction Problems
Abstract
We give new linear time globally explicit constructions for perfect hash families, cover-free families and separating hash functions.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.