An Ō(n) queries adaptive tester for unateness

Subhash Khot, Igor Shinkar

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

Abstract

We present an adaptive tester for the unateness property of Boolean functions. Given a function f : {0, 1}n → {0, 1} the tester makes O(n log(n)/ϵ) adaptive queries to the function. The tester always accepts a unate function, and rejects with probability at least 0.9 if a function is ϵ-far from being unate.

Original languageEnglish (US)
Title of host publicationApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Volume60
ISBN (Electronic)9783959770187
DOIs
StatePublished - Sep 1 2016
Event19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016 - Paris, France
Duration: Sep 7 2016Sep 9 2016

Other

Other19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016
CountryFrance
CityParis
Period9/7/169/9/16

Fingerprint

Boolean functions

Keywords

  • Boolean Functions
  • Property Testing
  • Unateness

ASJC Scopus subject areas

  • Software

Cite this

Khot, S., & Shinkar, I. (2016). An Ō(n) queries adaptive tester for unateness. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016 (Vol. 60). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.37

An Ō(n) queries adaptive tester for unateness. / Khot, Subhash; Shinkar, Igor.

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016. Vol. 60 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016.

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

Khot, S & Shinkar, I 2016, An Ō(n) queries adaptive tester for unateness. in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016. vol. 60, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016, Paris, France, 9/7/16. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.37
Khot S, Shinkar I. An Ō(n) queries adaptive tester for unateness. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016. Vol. 60. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016 https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.37
Khot, Subhash ; Shinkar, Igor. / An Ō(n) queries adaptive tester for unateness. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016. Vol. 60 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016.
@inproceedings{4f8a378c3038488c9eb5c54dc6d49745,
title = "An Ō(n) queries adaptive tester for unateness",
abstract = "We present an adaptive tester for the unateness property of Boolean functions. Given a function f : {0, 1}n → {0, 1} the tester makes O(n log(n)/ϵ) adaptive queries to the function. The tester always accepts a unate function, and rejects with probability at least 0.9 if a function is ϵ-far from being unate.",
keywords = "Boolean Functions, Property Testing, Unateness",
author = "Subhash Khot and Igor Shinkar",
year = "2016",
month = "9",
day = "1",
doi = "10.4230/LIPIcs.APPROX-RANDOM.2016.37",
language = "English (US)",
volume = "60",
booktitle = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

}

TY - GEN

T1 - An Ō(n) queries adaptive tester for unateness

AU - Khot, Subhash

AU - Shinkar, Igor

PY - 2016/9/1

Y1 - 2016/9/1

N2 - We present an adaptive tester for the unateness property of Boolean functions. Given a function f : {0, 1}n → {0, 1} the tester makes O(n log(n)/ϵ) adaptive queries to the function. The tester always accepts a unate function, and rejects with probability at least 0.9 if a function is ϵ-far from being unate.

AB - We present an adaptive tester for the unateness property of Boolean functions. Given a function f : {0, 1}n → {0, 1} the tester makes O(n log(n)/ϵ) adaptive queries to the function. The tester always accepts a unate function, and rejects with probability at least 0.9 if a function is ϵ-far from being unate.

KW - Boolean Functions

KW - Property Testing

KW - Unateness

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

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

U2 - 10.4230/LIPIcs.APPROX-RANDOM.2016.37

DO - 10.4230/LIPIcs.APPROX-RANDOM.2016.37

M3 - Conference contribution

AN - SCOPUS:84990857121

VL - 60

BT - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -