Improved Pseudorandom Generators for Combinatorial Rectangles

We construct a pseudorandom generator which uses bits and approximates the volume of any combinatorial rectangle in to within error. This improves on the previous construction using bits by Armoni, Saks, Wigderson, and Zhou [4]. For a subclass of rectangles with at most nontrivial dimensions and each dimension being an interval, we also give a pseudorandom generator using bits. This again improves the previous upper bound by Chari, Rohatgi, and Srinivasan [5].

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received July 29, 1998

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Lu, CJ. Improved Pseudorandom Generators for Combinatorial Rectangles. Combinatorica 22, 417–434 (2002). https://doi.org/10.1007/s004930200021

Download citation

  • AMS Subject Classification (2000) Classes:  05B40, 68Q25, 68R05