Identification of a monotone Boolean function with $k$ "reasons" as a combinatorial search problem

Dániel Gerbner, András Imolay, Gyula O. H. Katona +5

We study the number of queries needed to identify a monotone Boolean function $f:\{0,1{\}}^n\to \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of…