## Splitters and Near-Optimal Derandomization (1995)

### Cached

### Download Links

- [www.wisdom.weizmann.ac.il]
- [www.cs.caltech.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 36 - 1 self |

### BibTeX

@MISC{Naor95splittersand,

author = {Moni Naor and Leonard J. Schulman and Aravind Srinivasan},

title = {Splitters and Near-Optimal Derandomization},

year = {1995}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present a fairly general method for finding deterministic constructions obeying what we call k- restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n; k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2 configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal \Sigma\Pi\Sigma threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits.