Constructing Small Sets that are Uniform in Arithmetic Progressions
From MaRDI portal
Recommendations
Cites work
Cited in
(15)- Improved constructions of quantum automata
- Small sets which meet all the k(n)-term arithmetic progressions in the interval [1,n]
- The hardest halfspace
- Explicit small sets with \(\varepsilon\)-discrepancy on Bohr sets
- On the derandomization of the graph test for homomorphism over groups
- Computing Boolean functions via quantum hashing
- scientific article; zbMATH DE number 3855234 (Why is no real title available?)
- Минимизация коллизий при квантовом хешировании
- Sieving by large integers and covering systems of congruences
- Discrepancy in modular arithmetic progressions
- On the concept of quantum hashing
- Improved Constructions of Quantum Automata
- GAPs for Shallow Implementation of Quantum Finite Automata
- Explicit constructions of RIP matrices and related problems
- -discrepancy sets and their application for interpolation of sparse polynomials
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)