Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity

DOI10.1145/2382559.2382562zbMATH Open1322.68109OpenAlexW2170827767MaRDI QIDQ2947571FDOQ2947571

Ronitt Rubinfeld, O. Weinstein, Shmuel Safra, Dana Ron, Alex Samorodnitsky

Publication date: 24 September 2015

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2382559.2382562

zbMATH Keywords

symmetric chainsinfluence of a Boolean functionsublinear query approximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Boolean functions (06E30)

Cited In (5)

• Approximating the Noise Sensitivity of a Monotone Boolean Function
• Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity
• Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces
• On Monotonicity Testing and Boolean Isoperimetric-type Theorems
• Directed isoperimetric theorems for Boolean functions on the hypergrid and an \(\widetilde{O}(n\sqrt{d})\) monotonicity tester

This page was built for publication: Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity

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