A generalization of a theorem of Rothschild and van Lint
From MaRDI portal
Publication:5925692
DOI10.1016/j.tcs.2023.113802OpenAlexW4324344189WikidataQ123107694 ScholiaQ123107694MaRDI QIDQ5925692
Publication date: 12 April 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113802
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
- The Log-Approximate-Rank Conjecture Is False
- Analysis of Boolean Functions
- 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
