A lower bound for the hitting set size for combinatorial rectangles and an application

  • Authors:

  • L. Sunil Chandran

  • Affiliations:

  • Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany

  • Venue:
  • Information Processing Letters
  • Year:
  • 2003

Quantified Score

Hi-index 0.89

Visualization

Abstract

We prove a lower bound of Ω (1/ε(m + log(d - a)) where a = ⌈logm(1/4ε)⌉ for the hitting set size for combinatorial rectangles of volume at least ε in [m]d space, for ε ∈ [m-(d-2), 2/9] and d 2.