Abstract
We describe a deterministic algorithm which, on input integersd, 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 formR 1×R 2×...×R d of size at least ∈m d . The cardinality of S is polynomial inm(logd)/∈, and the time to construct it is polynomial inmd/∈. The construction of such sets has applications in derandomization methods based on small sample spaces for general multivalued random variables.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
