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.05001OpenAlexW2591581852MaRDI QIDQ2460691
Cécile Dartyge, András Sárközy
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
Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Cryptography (94A60) Combinatorial probability (60C05) Sequences (mod (m)) (11B50) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (15)
Balance and pattern distribution of sequences derived from pseudorandom subsets of \(\mathbb{Z}_q\) ⋮ Gowers norms and pseudorandom measures of subsets ⋮ On multi-dimensional pseudorandom subsets ⋮ Constructing quasi-random subsets of \(\mathbb Z_N\) by using elliptic curves ⋮ On the correlation measures of subsets ⋮ On the pseudo-randomness of subsets related to primitive roots ⋮ On the symmetry measure of pseudorandom subsets ⋮ On the complexity of families of pseudo-random subsets ⋮ Family Complexity and VC-Dimension ⋮ On large families of subsets of the set of the integers not exceeding \(N\) ⋮ Large families of pseudo-random subsets formed by generalized cyclotomic classes ⋮ On pseudorandom subsets in finite fields. I: Measure of pseudorandomness and support of Boolean functions ⋮ On the pseudorandom properties of subsets constructed by using primitive roots ⋮ On pseudo-random subsets of \({\mathbb{Z}}_n\) ⋮ Large family of pseudorandom subsets of the set of the integers not exceeding N
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
This page was built for publication: On pseudo-random subsets of the set of the integers not exceeding \(N\)