@inproceedings{89d264ac0acc4080b83b5cfaa7c4c60e,
title = "Proclaiming dictators and juntas or testing boolean formulae",
abstract = "We consider the problem of determining whether a given function f: \{0, 1\}n → \{0, 1\} belongs to a certain class of Boolean functions F or whether it is far from the class. More precisely, given query access to the function f and given a distance parameter ϵ, we wou ld like to decide whether f∈F or whether it differs from every g ∈F on more than an ϵ -fraction of the domain elements. The classes of functions we consider are singleton (“dictatorship”) functions, monomials, and monotone DNF functions with a bounded number of terms. In all cases we provide algorithms whose query complexity is independent of n (the number of function variables), and polynomial in the other relevant parameters.",
author = "Michal Parnas and Dana Ron and Alex Samorodnitsky",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001; 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 ; Conference date: 18-08-2001 Through 20-08-2001",
year = "2015",
language = "الإنجليزيّة",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "273--285",
editor = "Luca Trevisan and Klaus Jansen and Michel Goemans and Rolim, \{Jose D. P.\}",
booktitle = "Approximation, Randomization, and Combinatorial Optimization",
address = "ألمانيا",
}