Constructing Small Sets that are Uniform in Arithmetic Progressions
From MaRDI portal
Publication:4290101
DOI10.1017/S0963548300000870zbMATH Open0799.11022MaRDI QIDQ4290101FDOQ4290101
Authors: A. Wigderson, Alexander Razborov, Endre Szemerédi
Publication date: 20 November 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (15)
- The hardest halfspace
- Improved constructions of quantum automata
- \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials
- On the concept of quantum hashing
- Explicit small sets with \(\varepsilon\)-discrepancy on Bohr sets
- Discrepancy in modular arithmetic progressions
- Explicit constructions of RIP matrices and related problems
- On the derandomization of the graph test for homomorphism over groups
- Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]
- Sieving by large integers and covering systems of congruences
- GAPs for Shallow Implementation of Quantum Finite Automata
- Title not available (Why is that?)
- Минимизация коллизий при квантовом хешировании
- Computing Boolean functions via quantum hashing
- Improved Constructions of Quantum Automata
This page was built for publication: Constructing Small Sets that are Uniform in Arithmetic Progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290101)