Improved pseudorandom generators for combinatorial rectangles
From MaRDI portal
Publication:1872894
DOI10.1007/s004930200021zbMath1012.05047OpenAlexW2041493762MaRDI QIDQ1872894
Publication date: 18 May 2003
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930200021
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorial aspects of packing and covering (05B40)
Related Items (9)
Pseudorandomness via the Discrete Fourier Transform ⋮ Improved hardness amplification in NP ⋮ Unnamed Item ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Randomness buys depth for approximate counting ⋮ Bounded Independence Plus Noise Fools Products ⋮ Fourier bounds and pseudorandom generators for product tests ⋮ Unnamed Item
This page was built for publication: Improved pseudorandom generators for combinatorial rectangles