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

Nati Linial, Michael Luby, Michael Saks, David Zuckerman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

Given d, m and €, we deterministically produce a sequence of points S that hits every combinatorial rectangle in [m]d of volume at least 6. Both the running time of the algorithm and ISI are polynomial in m log(d) /€. This algorithm has applications to deterministic constructions of small sample spaces for general multivalued random variables.

Original languageAmerican English
Title of host publicationProceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993
PublisherAssociation for Computing Machinery
Pages258-267
Number of pages10
ISBN (Electronic)0897915917
DOIs
StatePublished - 1 Jun 1993
Event25th Annual ACM Symposium on Theory of Computing, STOC 1993 - San Diego, United States
Duration: 16 May 199318 May 1993

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129585
ISSN (Print)0737-8017

Conference

Conference25th Annual ACM Symposium on Theory of Computing, STOC 1993
Country/TerritoryUnited States
CitySan Diego
Period16/05/9318/05/93

Bibliographical note

Funding Information:
*Hebrew University, Computer Science Department, Jerusalem Israel. Research partially done while visiting the International Computer Science Institute. tInternational Computer Science Institute and UC Berkeley. Research partially supported by NSF Grant CCR-9016468 and grant No. 89-00312 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel. tDepartment of Mathematics, Rutgers University and Department of CSE, UCSD. Supported in part by NSF under grant CCR-8911388 and by AFOSR grants AFOSR-89-0512 AFOSR-90-OO08. Research partially done while visiting the International Computer Science Institute. ~Laboratory for Computer Science, MIT, Cambridge, Massachusetts. Research partially supported by an NSF Postdoctoral Fellowship. Research partially done while visiting the International Computer Science Institute.

Publisher Copyright:
© 1993 ACM.

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