Quasi-random Boolean functions
From MaRDI portal
Publication:6574391
DOI10.37236/11568zbMath1543.94821MaRDI QIDQ6574391
Fan R. K. Chung, Nicholas Sieger
Publication date: 18 July 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Weak hypergraph regularity and linear hypergraphs
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- The uniformity lemma for hypergraphs
- On ``bent functions
- Homomorphisms of edge-colored graphs and Coxeter groups
- Quasirandom permutations
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Quasi-Random Oriented Graphs
- Quasi-random tournaments
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Quasi-random hypergraphs
- Quasi‐random classes of hypergraphs
- Cohomological Aspects of Hypergraphs
- Quasi-Random Set Systems
- Analysis of Boolean Functions
- Communication Complexity and Quasi Randomness
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- The counting lemma for regular k‐uniform hypergraphs
- EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
- Quasi-random graphs
This page was built for publication: Quasi-random Boolean functions
