Skip to main content
SpringerLink
Log in

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

  • Published:
Combinatorica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Ajtai, J. Komlós, andE. Szemerédi: Deterministic Simulation in LOGSPACE, in:Proc. of 19th ACM Symposium on Theory of Computing, 1987, 132–140.

  2. R. Armoni, M. Saks, A. Wigderson, andS. Zhou: Discrepancy sets and pseudorandom generators for combinatorial rectangles,Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996.

  3. J. L. Carter, M. N. Wegman: Universal classes of hash functions,J. Comput. System Sci.,18 (1979), 143–154.

    Google Scholar 

  4. B. Chor, O. Goldreich: On the Power of Two-Point Based Sampling,Journal of Complexity,5 (1989), 96–106.

    Google Scholar 

  5. G. Even, O. Goldreich, M. Luby, N. Nisan, andB. Boban Veliĉković: Approximations of General Independent Distributions. in:Proc. of the 24th ACM Symposium on Theory of Computing, 1992.

  6. J. Friedman: ConstructingO(n log(n)) size monotone formulae for thekth threshold function ofn boolean variables.SIAM J. on Computing,15 (1986).

  7. O. Gabber, Z. Galil: Explicit constructions of linear-sized superconcentrators,Journal of Computer System Science,22 (1981), 407–420.

    Google Scholar 

  8. J. Kahn, N. Linial, andA. Samorodnitsky: Inclusion-Exclusion: Exact and approximate,Combinatorica,16 (1996), 465–477.

    Google Scholar 

  9. R. Karp, M. Pippenger, andM. Sipser:Time-Randomness Tradeoff, presented at the AMS conference on probabilistic computational complexity, Durham, New Hampshire, 1982.

  10. M. Karpinski, M. Luby: Approximating the Number of Solutions to aGF[2] Formula,Journal of Algorithms,14 (1993), 280–287.

    Google Scholar 

  11. M. Luby, B. Veliĉković: On Deterministic Approximation of DNF, in:Proceedings of 23rd ACM Symposium on Theory of Computing, 1991, 430–438,Algorithmica (special issue devoted to randomized algorithms), Vol. 16, No. 4/5, October/November 1996, 415–433.

  12. M. Luby, A. Wigderson, andB. Veliĉković: Deterministic Approximate Counting of Depth-2 Circuits, in:Proceedings of the Second Israeli Symposium on Theory of Computing and Systems, 1993, 18–24.

  13. G. A. Margulis: Explicit construction of concentrators,Problemy Peredaĉi Informacii 9, (1973) 71–80. (English translation inProblems Inform. Transmission, 1975).

    Google Scholar 

  14. N. Nisan: Pseudorandom Generators for Space-Bounded Computation,Combinatorica,12 (1992), 449–461.

    Google Scholar 

  15. J. Schmidt, A. Siegel: The Spatial Complexity of obliviousk-probe hash functions,SIAM Journal on Computing,19 (1990), 775–786.

    Google Scholar 

  16. M. Sipser: Expanders, Randomness, or Time vs. Space,Journal of Computer and System Sciences,36 (1988), 379–383.

    Google Scholar 

  17. D. Zuckerman: Simulating BPP Using a General Weak Random Source,Algorithmica,16 (1996), 367–391.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Hebrew University, Jerusalem, Israel

    Nathan Linial

  2. DEC/SRC, 130 Lytton Avenue, 94301, Palo Alto, California

    Michael Luby

  3. Department of Mathematics, Rutgers University, 08854, New Brunswick, NJ, USA

    Michael Saks

  4. Department of Computer Sciences, The University of Texas at Austin, 78713, Austin, Texas, USA

    David Zuckerman

Authors
  1. Nathan Linial
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Luby
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Saks
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. David Zuckerman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

A preliminary version of this paper appeared in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993.

Research partially done while visiting the International Computer Science Institute. Research supported in part by a grant from the Israel-USA Binational Science Foundation.

A large portion of this research was done while still at the International Computer Science Institute in Berkeley, California. Research supported in part by National Science Foundation operating grants CCR-9304722 and NCR-9416101, and United States-Israel Binational Science Foundation grant No. 92-00226.

Supported in part by NSF under grants CCR-8911388 and CCR-9215293 and by AFOSR grants AFOSR-89-0512 AFOSR-90-0008, and by DIMACS, which is supported by NSF grant STC-91-19999 and by the New Jersey Commission on Science and Technology. Research partially done while visiting the International Computer Science Institute.

Partially supported by NSF NYI Grant No. CCR-9457799. Most of this research was done while the author was at MIT, partially supported by an NSF Postdoctoral Fellowship. Research partially done while visiting the International Computer Science Institute.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Linial, N., Luby, M., Saks, M. et al. Efficient construction of a small hitting set for combinatorial rectangles in high dimension. Combinatorica 17, 215–234 (1997). https://doi.org/10.1007/BF01200907

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01200907

Mathematics Subject Classification (1991)

Search

Navigation