A generalization of a theorem of Rothschild and van Lint
From MaRDI portal
Publication:5918630
DOI10.1007/978-3-030-79416-3_28OpenAlexW3176744994MaRDI QIDQ5918630
Publication date: 21 March 2022
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.16811
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the parity complexity measures of Boolean functions
- Boolean functions with low average sensitivity depend on few coordinates
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- On the structure of Boolean functions with small spectral norm
- Characterizing finite subspaces
- On the Freiman theorem in finite fields
- Fuglede’s conjecture for a union of two intervals
- The Chow Parameters Problem
- On Sums of Generating Sets in ℤ2n
- Communication is Bounded by Root of Rank
- Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces
- SETS WITH SMALL SUMSET AND RECTIFICATION
- From Affine to Two-Source Extractors via Approximate Duality
- A Note on Freĭman's Theorem in Vector Spaces
- Freiman's Theorem in Finite Fields via Extremal Set Theory
- Spectral analysis of Boolean functions as a graph eigenvalue problem
- Structure of Protocols for XOR Functions
- Non-Malleable Codes from Additive Combinatorics
- Sensitivity Conjecture and Log-rank Conjecture for functions with small alternating numbers
- Analysis of Boolean Functions
- The log-approximate-rank conjecture is false
- New bounds for matching vector families
- An Additive Combinatorics Approach Relating Rank to Communication Complexity
- Fourier Sparsity of GF(2) Polynomials
- Testing Fourier Dimensionality and Sparsity
This page was built for publication: A generalization of a theorem of Rothschild and van Lint
