Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]

DOI10.1137/1.9781611975482.128zbMath1432.68349OpenAlexW2907567654MaRDI QIDQ5236315

Prahladh Harsha, Yuval Filmus, Irit Dinur

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975482.128

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Related Items (4)

Boolean functions on $S_n$ which are nearly linear ⋮ Unnamed Item ⋮ A structure theorem for almost low-degree functions on the slice ⋮ Boolean constant degree functions on the slice are juntas

This page was built for publication: Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]