License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2016.37
URN: urn:nbn:de:0030-drops-66603
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6660/
Khot, Subhash ;
Shinkar, Igor
An ~O(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)/epsilon) adaptive queries to the function. The tester always accepts a unate function, and rejects with probability at least 0.9 if a function is epsilon-far from being unate.
BibTeX - Entry
@InProceedings{khot_et_al:LIPIcs:2016:6660,
author = {Subhash Khot and Igor Shinkar},
title = {{An ~O(n) Queries Adaptive Tester for Unateness}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {37:1--37:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Klaus Jansen and Claire Mathieu and Jos{\'e} D. P. Rolim and Chris Umans},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6660},
URN = {urn:nbn:de:0030-drops-66603},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.37},
annote = {Keywords: property testing, boolean functions, unateness}
}
Keywords: |
|
property testing, boolean functions, unateness |
Collection: |
|
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016) |
Issue Date: |
|
2016 |
Date of publication: |
|
06.09.2016 |