Linear time Constructions of some dd-Restriction Problems

preprint2014arXivOpen access

Abstract

We give new linear time globally explicit constructions for perfect hash families, cover-free families and separating hash functions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.