On the complexity of families of pseudo-random subsets

DOI10.5802/aif.2847zbMath1314.11048arXiv1302.4622MaRDI QIDQ486751

Yong-Cai Geng, Sumit K. Garg

Publication date: 16 January 2015

Published in: Annales de l'Institut Fourier (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.4622

zbMATH Keywords

complexity; exponential sums; character sums; pseudo-random subsets

Mathematics Subject Classification ID

11L07: Estimates on exponential sums

05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)

11K45: Pseudo-random numbers; Monte Carlo methods