Tiny families of functions with random properties (preliminary version)
From MaRDI portal
Publication:2817652
DOI10.1145/195058.195410zbMath1345.68117OpenAlexW2024312599MaRDI QIDQ2817652
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195410
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (3)
More efficient DDH pseudorandom generators ⋮ Lower bounds for sampling algorithms for estimating the average ⋮ Extracting randomness: A survey and new constructions
This page was built for publication: Tiny families of functions with random properties (preliminary version)
