Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension

Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension (1993)

Cached

Download Links

[www.icsi.berkeley.edu]
[www.cs.utexas.edu]

Other Repositories/Bibliography

DBLP

by Nati Linial , Michael Luby , Michael Saks , David Zuckerman

Citations:

20 - 7 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension	user correction - Legacy Corrections
AUTHOR NAME	Nati Linial	user correction - Legacy Corrections
AUTHOR NAME	Michael Luby	user correction - Legacy Corrections
AUTHOR NAME	Michael Saks	user correction - Legacy Corrections
AUTHOR AFFIL	z	user correction - Legacy Corrections
AUTHOR NAME	David Zuckerman	user correction - Legacy Corrections
AUTHOR AFFIL	x	user correction - Legacy Corrections
ABSTRACT	Given d, m and epsilon, we deterministically produce a sequence of points S that hits every combinatorial rectangle in [m]^d of volume at least epsilon. Both the running time of the algorithm and \|S\| are polynomial in m log(d)/epsilon. This algorithm has applications to deterministic constructions of small sample spaces for general multivalued random variables. 1 Introduction The problem we consider in this paper is motivated by the following basic witness finding problem: design an efficient algorithm that on Hebrew University, Computer Science Department, Jerusalem Israel. Research partially done while visiting the International Computer Science Institute. y International 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. z Department of Mathematics, Rutgers University and Department of CSE, UCSD. Supported in part by NSF under grant C...	user correction - Legacy Corrections
YEAR	1993	user correction - Legacy Corrections
CITATIONS	11 found	ParsCit 1.0