2000 character limit reached
Linear time Constructions of some $d$-Restriction Problems
Published 9 Jun 2014 in cs.DM and math.CO | (1406.2108v2)
Abstract: We give new linear time globally explicit constructions for perfect hash families, cover-free families and separating hash functions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.