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...
        Saved in:
      
    
          | Published in | 2015 IEEE 56th Annual Symposium on Foundations of Computer Science pp. 52 - 58 | 
|---|---|
| Main Authors | , , | 
| Format | Conference Proceeding | 
| Language | English | 
| Published | 
            IEEE
    
        01.10.2015
     | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 0272-5428 | 
| DOI | 10.1109/FOCS.2015.13 | 
Cover
| 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 |