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

Combinatorica

Volumn 17, Issue 2, 1997, Pages 215-234

  Linial, Nathan ^a   Luby, Michael ^c   Saks, Michael ^b   Zuckerman, David ^d  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b RUTGERS UNIVERSITY   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

^d University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031498527     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01200907     Document Type: Article

References (19)

1. M. AJTAI, J. KOMLÓS, and E. 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, and S. 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.
4. B. CHOR, O. GOLDREICH: On the Power of Two-Point Based Sampling, Journal of Complexity, 5 (1989), 96-106.
5. G. EVEN, O. GOLDREICH, M. LUBY, N. NISAN, and B. BOBAN VELIČKOVIĆ: Approximations of General Independent Distributions, in: Proc. of the 24th ACM Symposium on Theory of Computing, 1992.
6. J. FRIEDMAN: Constructing O(n log(n)) size monotone formulae for the kth threshold function of n 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.
8. J. KAHN, N. LINIAL, and A. SAMORODNITSKY: Inclusion-Exclusion: Exact and approximate, Combinatorica, 16 (1996), 465-477.
9. R. KARP, M. PIPPENGER, and M. 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 a GF[2] Formula, Journal of Algorithms, 14 (1993), 280-287.
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, 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.
13. M. LUBY, A. WIGDERSON, and B. 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.
14. G. A. MARGULIS: Explicit construction of concentrators, Problemy Peredači Informacii 9, (1973) 71-80. (English translation in Problems Inform. Transmission, 1975).
15. G. A. MARGULIS: Explicit construction of concentrators, Problemy Peredači Informacii 9, (1973) 71-80. (English translation in Problems Inform. Transmission, 1975).
16. N. NISAN: Pseudorandom Generators for Space-Bounded Computation, Combinatorica, 12 (1992), 449-461.
17. J. SCHMIDT, A. SIEGEL: The Spatial Complexity of oblivious k-probe hash functions, SIAM Journal on Computing, 19 (1990), 775-786.
18. M. SIPSER: Expanders, Randomness, or Time vs. Space, Journal of Computer and System Sciences, 36 (1988), 379-383.
19. D. ZUCKERMAN: Simulating BPP Using a General Weak Random Source, Algorithmica, 16 (1996), 367-391.