On the complexity of families of pseudo-random subsets
From MaRDI portal
Publication:486751
DOI10.5802/aif.2847zbMath1314.11048arXiv1302.4622OpenAlexW2962769037MaRDI QIDQ486751
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
Estimates on exponential sums (11L07) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (3)
A new lower bound on the family complexity of Legendre sequences ⋮ On pseudorandomness of families of binary sequences ⋮ On the complexity of a family of Legendre sequences with irreducible polynomials
Cites Work
- On \(p\)-pseudorandom binary sequences
- Exponential sums and Newton polyhedra: cohomology and estimates
- On large families of subsets of the set of the integers not exceeding \(N\)
- Incomplete Kloosterman sums and a divisor problem. Appendix: On some exponential sums by Bryan J. Birch and Enrico Bombieri
- Equations over finite fields. An elementary approach
- La conjecture de Weil. I
- A complexity measure for families of binary sequences
- Construction of pseudorandom binary sequences using additive characters
- On the pseudo-randomness of subsets related to primitive roots
- Sum-free sets in abelian groups
- On pseudo-random subsets of the set of the integers not exceeding \(N\)
- Purity of exponential sums on 𝔸 n , II
- Bounds for exponential sums and their applications to pseudorandom numbers
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- A finite pseudorandom binary sequence
- On Exponential Sums in Finite Fields
- On the Rationality of the Zeta Function of an Algebraic Variety
- Number of Points of Varieties in Finite Fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the complexity of families of pseudo-random subsets
