On Monotonicity Testing and Boolean Isoperimetric Type Theorems

Subhash Khot, Dor Minzer, Muli Safra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We show a directed and robust analogue of a boolean isoperimetric type theorem of Talagrand. As an application, we give a monotonicity testing algorithm that makes, up to polylog factors, (square root of n)/∈2 non-adaptive queries to a function f:0, 1n -> 0, 1, always accepts a monotone function and rejects a function that is ∈-far from being monotone with constant probability.

Original languageEnglish (US)
Title of host publicationProceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015
PublisherIEEE Computer Society
Pages52-58
Number of pages7
Volume2015-December
ISBN (Print)9781467381918
DOIs
StatePublished - Dec 11 2015
Event56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015 - Berkeley, United States
Duration: Oct 17 2015Oct 20 2015

Other

Other56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015
CountryUnited States
CityBerkeley
Period10/17/1510/20/15

Fingerprint

Testing

Keywords

  • Boolean functions
  • isoperimetry
  • monotone functions
  • property testing

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Khot, S., Minzer, D., & Safra, M. (2015). On Monotonicity Testing and Boolean Isoperimetric Type Theorems. In Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015 (Vol. 2015-December, pp. 52-58). [7354387] IEEE Computer Society. https://doi.org/10.1109/FOCS.2015.13

On Monotonicity Testing and Boolean Isoperimetric Type Theorems. / Khot, Subhash; Minzer, Dor; Safra, Muli.

Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. Vol. 2015-December IEEE Computer Society, 2015. p. 52-58 7354387.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khot, S, Minzer, D & Safra, M 2015, On Monotonicity Testing and Boolean Isoperimetric Type Theorems. in Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. vol. 2015-December, 7354387, IEEE Computer Society, pp. 52-58, 56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, United States, 10/17/15. https://doi.org/10.1109/FOCS.2015.13
Khot S, Minzer D, Safra M. On Monotonicity Testing and Boolean Isoperimetric Type Theorems. In Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. Vol. 2015-December. IEEE Computer Society. 2015. p. 52-58. 7354387 https://doi.org/10.1109/FOCS.2015.13
Khot, Subhash ; Minzer, Dor ; Safra, Muli. / On Monotonicity Testing and Boolean Isoperimetric Type Theorems. Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015. Vol. 2015-December IEEE Computer Society, 2015. pp. 52-58
@inproceedings{bb506233170b4b0a80eb2eb3d14b876c,
title = "On Monotonicity Testing and Boolean Isoperimetric Type Theorems",
abstract = "We show a directed and robust analogue of a boolean isoperimetric type theorem of Talagrand. As an application, we give a monotonicity testing algorithm that makes, up to polylog factors, (square root of n)/∈2 non-adaptive queries to a function f:0, 1n -> 0, 1, always accepts a monotone function and rejects a function that is ∈-far from being monotone with constant probability.",
keywords = "Boolean functions, isoperimetry, monotone functions, property testing",
author = "Subhash Khot and Dor Minzer and Muli Safra",
year = "2015",
month = "12",
day = "11",
doi = "10.1109/FOCS.2015.13",
language = "English (US)",
isbn = "9781467381918",
volume = "2015-December",
pages = "52--58",
booktitle = "Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - On Monotonicity Testing and Boolean Isoperimetric Type Theorems

AU - Khot, Subhash

AU - Minzer, Dor

AU - Safra, Muli

PY - 2015/12/11

Y1 - 2015/12/11

N2 - We show a directed and robust analogue of a boolean isoperimetric type theorem of Talagrand. As an application, we give a monotonicity testing algorithm that makes, up to polylog factors, (square root of n)/∈2 non-adaptive queries to a function f:0, 1n -> 0, 1, always accepts a monotone function and rejects a function that is ∈-far from being monotone with constant probability.

AB - We show a directed and robust analogue of a boolean isoperimetric type theorem of Talagrand. As an application, we give a monotonicity testing algorithm that makes, up to polylog factors, (square root of n)/∈2 non-adaptive queries to a function f:0, 1n -> 0, 1, always accepts a monotone function and rejects a function that is ∈-far from being monotone with constant probability.

KW - Boolean functions

KW - isoperimetry

KW - monotone functions

KW - property testing

UR - http://www.scopus.com/inward/record.url?scp=84960453514&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84960453514&partnerID=8YFLogxK

U2 - 10.1109/FOCS.2015.13

DO - 10.1109/FOCS.2015.13

M3 - Conference contribution

SN - 9781467381918

VL - 2015-December

SP - 52

EP - 58

BT - Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015

PB - IEEE Computer Society

ER -