Constructing Small Sets that are Uniform in Arithmetic Progressions

DOI10.1017/S0963548300000870zbMath0799.11022MaRDI QIDQ4290101

Endre Szemerédi, Avi Wigderson, Alexander A. Razborov

Publication date: 20 November 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

discrepancysmall sets uniform in arithmetic progressions

Mathematics Subject Classification ID

Arithmetic progressions (11B25) General theory of distribution modulo (1) (11K06)

Related Items (11)

Computing Boolean Functions via Quantum Hashing ⋮ On the derandomization of the graph test for homomorphism over groups ⋮ GAPs for Shallow Implementation of Quantum Finite Automata ⋮ Explicit constructions of RIP matrices and related problems ⋮ \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials ⋮ О понятии квантового хеширования ⋮ The hardest halfspace ⋮ Explicit small sets with \(\varepsilon\)-discrepancy on Bohr sets ⋮ Минимизация коллизий при квантовом хешировании ⋮ Improved constructions of quantum automata ⋮ Improved Constructions of Quantum Automata

Cites Work

• Roth's estimate of the discrepancy of integer sequences is nearly sharp
• Construction of a Thin Set with small Fourier Coefficients
• Essential Components

This page was built for publication: Constructing Small Sets that are Uniform in Arithmetic Progressions