Sparse juntas on the biased hypercube
From MaRDI portal
Publication:6586929
DOI10.46298/THEORETICS.24.18MaRDI QIDQ6586929FDOQ6586929
Authors: Irit Dinur, Yuval Filmus, Prahladh Harsha 
Publication date: 13 August 2024
Published in: TheoretiCS (Search for Journal in Brave)
Theory of computing (68Qxx) Boolean algebras (Boolean rings) (06Exx) Miscellaneous topics in information and communication theory (94Dxx)
Cites Work
- On the degree of Boolean functions as real polynomials
- Polynomials with two values
- Friedgut-Kalai-Naor theorem for slices of the Boolean cube
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- An asymptotically tight bound on the number of relevant variables in a bounded degree Boolean function
- A structure theorem for almost low-degree functions on the slice
- Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests
- New direct-product testers and 2-query PCPs
- Junta threshold for low degree Boolean functions on the slice
- Boolean functions on \(S_n\) which are nearly linear
- Pseudorandom sets in Grassmann graph have near-perfect expansion
This page was built for publication: Sparse juntas on the biased hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586929)
