Testing unateness nearly optimally

DOI10.1145/3313276.3316351zbMath1434.68671arXiv1904.05309OpenAlexW2964156930MaRDI QIDQ5212796

Erik Waingarten, Xi Chen

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.05309

zbMATH Keywords

Boolean functionsproperty testingunateness

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items

Approximating the distance to monotonicity of Boolean functions, Almost Optimal Distribution-Free Sample-Based Testing of k-Modality, Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity