Abstract
We explicitly construct a pseudorandom generator which uses O(log m + log d + log3/2 1/ε) bits and approximates the volume of any combinatorial rectangle in [m]d = {1,... m}d to within ε error. This improves on the previous construction by Armoni, Saks, Wigderson, and Zhou [4] using O(log m + log d + log2 1/ε) bits. For a subclass of rectangles with at most t ≥ log 1/ε nontrivial dimensions and each dimension being an interval, we also give a pseudorandom generator using O(log log d + log 1/ε log1/2 t/log 1/ε) bits, which again improves the previous upper bound O(log log d + log 1/ε log t/log 1/ε) by Chari, Rohatgi, and Srinivasan [5].
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A.E. Andreev, A.E.F. Clementi, and J.D.P. Rolim, Efficient constructions of hitting sets for system of linear functions, In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, pages 387–398, 1997
N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple constructions of almost k-wise independent random variables, Random Structures and Algorithms, 3(3), pages 289–303, 1992.
P. Auer, P. Long, and A. Srinivasan, Approximating hyper-rectangles: learning and pseudo-random sets, In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997.
R. Armoni, M. Saks, A. Wigderson, and S. Zhou, Discrepancy sets and pseudorandom generators for combinatorial rectangles, In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 412–421, 1996.
S. Chari, P. Rohatgi, and A. Srinivasan, Improved algorithms via approximations of probability distributions, In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 584–592, 1994.
G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velickovic, Approximations of general independent distributions. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 10–16, 1992.
O. Goldreich and A. Wigderson, Tiny families of functions with random properties: a quality-size trade-off for hashing, In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 574–583, 1994.
R. Impagliazzo, N. Nisan, and A. Wigderson, Pseudorandomness for network algorithms, In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 356–364, 1994.
N. Linial, M. Luby, M. Saks, and D. Zuckerman, Efficient construction of a small hitting set for combinatorial rectangles in high dimension, In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 258–267, 1993.
J. Naor and M. Naor, Small-bias probability spaces: efficient constructions and applications, SIAM Journal on Computing, 22(4), pages 838–856, 1990.
N. Nisan, Pseudorandom generators for space-bounded computation, Combinatorica, 12, pages 449–461, 1992.
N. Nisan, Extracting randomness: how and why — a survey, In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 44–58, 1996.
N. Nisan and D. Zuckerman, Randomness is linear in space, Journal of Computer and System Sciences, 52(1), pages 43–52, 1996.
J. Radhakrishnan and A. Ta-shma, Private communication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, CJ. (1998). Improved pseudorandom generators for combinatorial rectangles. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055056
Download citation
DOI: https://doi.org/10.1007/BFb0055056
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64781-2
Online ISBN: 978-3-540-68681-1
eBook Packages: Springer Book Archive