Skip to Main Content
The problem of finding optimal querying policy, for expected query complexity of symmetric boolean threshold functions was solved in  in the context of collocated networks. In this paper, instead of considering the optimal policy to compute the functions, we define the problem of verification of the function value. We use this idea to provide a simpler proof of the optimal querying policy for threshold functions. The method is more generic and is extended to delta and some other symmetric functions. We also provide some partial results for interval functions and finally address a question posed in . Recently we have extended these results to any symmetric function of boolean inputs, which we mention at the end.