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

DOI10.1145/167088.167166MaRDI QIDQ5248494zbMATH OpenOpenAlexFDO

Authors Nathan Linial, Michael Luby, David Zuckerman, Michael Saks

Publication date 7 May 2015

Published in Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/167088.167166

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(3)

• Approximating hyper-rectangles: Learning and pseudorandom sets
• Simulating BPP using a general weak random source
• Efficient constructions of hitting sets for systems of linear functions

This page was built for publication: Efficient construction of a small hitting set for combinatorial rectangles in high dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248494)