Efficient construction of a small hitting set for combinatorial rectangles in high dimension
暂无分享,去创建一个
[1] Michael E. Saks,et al. Discrepancy sets and pseudorandom generators for combinatorial rectangles , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[2] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..
[3] Oded Goldreich,et al. On the power of two-point based sampling , 1989, J. Complex..
[4] Michael Sipser,et al. Expanders, Randomness, or Time versus Space , 1988, J. Comput. Syst. Sci..
[5] Alex Samorodnitsky,et al. Inclusion-exclusion: Exact and approximate , 1996, Comb..
[6] Joel Friedman. Constructing O(n log n) Size Monotone Formulae for the k-th Threshold Function of n Boolean Variables , 1986, SIAM J. Comput..
[7] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[8] Marek Karpinski,et al. Approximating the number of zeroes of a GF[2] polynomial , 1991, SODA '91.
[9] Jeanette P. Schmidt,et al. The Spatial Complexity of Oblivious k-Probe Hash Functions , 2018, SIAM J. Comput..
[10] Noam Nisan,et al. Pseudorandom generators for space-bounded computation , 1992, Comb..
[11] János Komlós,et al. Deterministic simulation in LOGSPACE , 1987, STOC.