On Monotonicity Testing and Boolean Isoperimetric Type Theorems

We show a directed and robust analogue of a boolean isoperimetric type theorem of Talagrand [13]. As an application, we give a monotonicity testing algorithm that makes O̅(√n/ε 2 ) non-adaptive queries to a function f : {0, 1} n → {0, 1}, always accepts a monotone function and rejects a function tha...

Full description

Saved in:
Bibliographic Details
Published in2015 IEEE 56th Annual Symposium on Foundations of Computer Science pp. 52 - 58
Main Authors Khot, Subhash, Minzer, Dor, Safra, Muli
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2015
Subjects
Online AccessGet full text
ISSN0272-5428
DOI10.1109/FOCS.2015.13

Cover

More Information
Summary:We show a directed and robust analogue of a boolean isoperimetric type theorem of Talagrand [13]. As an application, we give a monotonicity testing algorithm that makes O̅(√n/ε 2 ) non-adaptive queries to a function f : {0, 1} n → {0, 1}, always accepts a monotone function and rejects a function that is ε-far from being monotone with constant probability.
ISSN:0272-5428
DOI:10.1109/FOCS.2015.13