Efficient construction of a small hitting set for combinatorial rectangles in high dimension

Nathan Linial, Michael Luby, Michael Saks, David Zuckerman

Research output: Contribution to journalArticlepeer-review

36 Scopus citations

Abstract

We describe a deterministic algorithm which, on input integers d, m and real number ∈ ∈ (0, 1), produces a subset S of [m]d = {1,2,3, . . . , m}d that hits every combinatorial rectangle in [m]d of volume at least ∈, i.e., every subset of [m]d the form R1 × R2 × . . . × Rd of size at least ∈md. The cardinality of S is polynomial in m(log d)/∈, and the time to construct it is polynomial in md/∈. The construction of such sets has applications in derandomization methods based on small sample spaces for general multivalued random variables.

Original languageEnglish (US)
Pages (from-to)215-234
Number of pages20
JournalCombinatorica
Volume17
Issue number2
DOIs
StatePublished - 1997

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Efficient construction of a small hitting set for combinatorial rectangles in high dimension'. Together they form a unique fingerprint.

Cite this