Constructing Small Sets that are Uniform in Arithmetic Progressions-Reference-Cited by-同舟云学术

Constructing Small Sets that are Uniform in Arithmetic Progressions

Published:1993-12 Issue:4 Volume:2 Page:513-518
ISSN:0963-5483
Container-title:Combinatorics, Probability and Computing
language:en
Short-container-title:Combinator. Probab. Comp.

Author:

Razborov A.,Szemerédi E.,Wigderson A.

Abstract

For every integer N, we explicitly construct a subset of residues mod N of size(log N)o(1) which is nearly uniformly distributed in every arithmetic progression modulo N.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science

Reference11 articles.

1. On nontrivial separators for k-page graphs, and simulations by nondeterministic one-tape Turing machines;Galil;Proc. 18th STOC,1986

2. Roth’s estimate of the discrepancy of integer sequences is nearly sharp

3. Random Cayley graphs and expanders;Alon;Random Structures and Algorithms

4. Diameters and eigenvalues;Chung;J. AMS,1989

5. Approximations of general independent distributions;Even;Proc. 24th STOC,1992

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. GAPs for Shallow Implementation of Quantum Finite Automata;Electronic Proceedings in Theoretical Computer Science;2023-09-03

2. The hardest halfspace;computational complexity;2021-08-03

3. On the concept of cryptographic quantum hashing;Laser Physics Letters;2015-11-10

4. Quantum hashing via ∈-universal hashing constructions and classical fingerprinting;Lobachevskii Journal of Mathematics;2015-04

5. Explicit small sets with ε-discrepancy on Bohr sets;Information Processing Letters;2014-10