Efficient construction of a small hitting set for combinatorial rectangles in high dimension
- 1 June 1997
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 17 (2) , 215-234
- https://doi.org/10.1007/bf01200907
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Inclusion-exclusion: Exact and approximateCombinatorica, 1996
- On deterministic approximation of DNFAlgorithmica, 1996
- Simulating BPP using a general weak random sourceAlgorithmica, 1996
- Approximating the Number of Zeroes of a GF[2] PolynomialJournal of Algorithms, 1993
- Pseudorandom generators for space-bounded computationCombinatorica, 1992
- The Spatial Complexity of Oblivious k-Probe Hash FunctionsSIAM Journal on Computing, 1990
- On the power of two-point based samplingJournal of Complexity, 1989
- Expanders, randomness, or time versus spaceJournal of Computer and System Sciences, 1988
- Explicit constructions of linear-sized superconcentratorsJournal of Computer and System Sciences, 1981
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979