Quasi-random Boolean functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1944144 (Why is no real title available?)
- Analysis of Boolean Functions
- Cohomological Aspects of Hypergraphs
- Communication Complexity and Quasi Randomness
- Eigenvalues and linear quasirandom hypergraphs
- Higher-order Fourier analysis and applications
- Homomorphisms of edge-colored graphs and Coxeter groups
- Hypergraph regularity and the multidimensional Szemerédi theorem
- On ``bent functions
- Quasi-Random Set Systems
- Quasi-random graphs
- Quasi-random hypergraphs
- Quasi-random oriented graphs
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- Quasi-random tournaments
- Quasirandom permutations
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Quasi‐random classes of hypergraphs
- Regular Partitions of Hypergraphs: Counting Lemmas
- Regular Partitions of Hypergraphs: Regularity Lemmas
- The counting lemma for regular k‐uniform hypergraphs
- The uniformity lemma for hypergraphs
- Weak hypergraph regularity and linear hypergraphs
This page was built for publication: Quasi-random Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574391)