Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions

DOI10.1137/1.9781611975994.122MaRDI QIDQ5146908zbMATH OpenOpenAlexFDO

Authors Hadley Black, Deeparnab Chakrabarty, C. Seshadhri

Publication date 2 February 2021

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

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(9)

• Almost Optimal Distribution-Free Sample-Based Testing of k-Modality
• Approximating the distance to monotonicity of Boolean functions
• Directed isoperimetric theorems for Boolean functions on the hypergrid and an \(\widetilde{O}(n\sqrt{d})\) monotonicity tester
• Sample-based distance-approximation for subsequence-freeness
• Isoperimetric inequalities for real-valued functions with applications to monotonicity testing
• Testing intersecting and union-closed families
• Nearly optimal bounds for sample-based testing and learning of k-monotone functions
• Agnostic proper learning of monotone functions: beyond the black-box correction barrier
• A \(d^{1/2+o(1)}\) monotonicity tester for Boolean functions on \(d\)-dimensional hypergrids

This page was built for publication: Domain Reduction for Monotonicity Testing: A o(d) Tester for Boolean Functions in d-Dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146908)