TY - GEN
T1 - Almost optimal testers for concise representations
AU - Bshouty, Nader H.
N1 - Publisher Copyright: © 2020 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.
PY - 2020/8/1
Y1 - 2020/8/1
N2 - We give improved and almost optimal testers for several classes of Boolean functions on n variables that have concise representation in the uniform and distribution-free model. Classes, such as k-Junta, k-Linear, s-Term DNF, s-Term Monotone DNF, r-DNF, Decision List, r-Decision List, size-s Decision Tree, size-s Boolean Formula, size-s Branching Program, s-Sparse Polynomial over the binary field and functions with Fourier Degree at most d. The approach is new and combines ideas from Diakonikolas et al. [24], Bshouty [13], Goldreich et al. [32], and learning theory. The method can be extended to several other classes of functions over any domain that can be approximated by functions with a small number of relevant variables.
AB - We give improved and almost optimal testers for several classes of Boolean functions on n variables that have concise representation in the uniform and distribution-free model. Classes, such as k-Junta, k-Linear, s-Term DNF, s-Term Monotone DNF, r-DNF, Decision List, r-Decision List, size-s Decision Tree, size-s Boolean Formula, size-s Branching Program, s-Sparse Polynomial over the binary field and functions with Fourier Degree at most d. The approach is new and combines ideas from Diakonikolas et al. [24], Bshouty [13], Goldreich et al. [32], and learning theory. The method can be extended to several other classes of functions over any domain that can be approximated by functions with a small number of relevant variables.
KW - Boolean function
KW - Junta
KW - Property Testing
UR - http://www.scopus.com/inward/record.url?scp=85091288246&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.APPROX/RANDOM.2020.5
DO - 10.4230/LIPIcs.APPROX/RANDOM.2020.5
M3 - منشور من مؤتمر
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020
A2 - Byrka, Jaroslaw
A2 - Meka, Raghu
T2 - 23rd International Conference on Approximation Algorithms for Combinatorial Optimization Problems and 24th International Conference on Randomization and Computation, APPROX/RANDOM 2020
Y2 - 17 August 2020 through 19 August 2020
ER -