On pseudo-random subsets of the set of the integers not exceeding \(N\)
From MaRDI portal
Publication:2460691
DOI10.1007/s-10998-007-2183-yzbMath1174.05001MaRDI QIDQ2460691
András Sárközy, Cécile Dartyge
Publication date: 12 November 2007
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s-10998-007-2183-y
68R05: Combinatorics in computer science
05A05: Permutations, words, matrices
94A60: Cryptography
60C05: Combinatorial probability
11B50: Sequences (mod (m))
11K45: Pseudo-random numbers; Monte Carlo methods
Related Items
Family Complexity and VC-Dimension, Large families of pseudo-random subsets formed by generalized cyclotomic classes, On large families of subsets of the set of the integers not exceeding \(N\), On pseudo-random subsets of \({\mathbb{Z}}_n\), Constructing quasi-random subsets of \(\mathbb Z_N\) by using elliptic curves, On the pseudo-randomness of subsets related to primitive roots
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(p\)-pseudorandom binary sequences
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- On testing the `pseudo-randomness' of a hypergraph
- On the number of times a root of \(f(n,x)=0\) generates a field containing a given number field
- Hypergraphs, quasi-randomness, and conditions for regularity
- Pseudo-random hypergraphs
- On pseudorandomness in families of sequences derived from the Legendre symbol
- Construction of pseudorandom binary sequences by using the multiplicative inverse
- Quasi-random hypergraphs
- The distribution of r ‐tuples of square‐free numbers
- Szemerédi's partition and quasirandomness
- Quasi‐random classes of hypergraphs
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Quasi-Random Set Systems
- A finite pseudorandom binary sequence
- Quasi-random graphs
- Quasi-random graphs
