5 research outputs found
Weakly balanced multi-branching AND-OR trees: Reconstruction of the omitted part of Saks-Wigderson (1986) (Theory and Applications of Proof and Computation)
Get PDFWe investigate variants of the Nash equilibrium for query complexity of Boolean functions. We reconstruct some omitted proofs and definitions in the paper of Saks and Wigderson (1986). In particular, by extending observation by Arimoto (2020), we introduce concepts of “weakly balanced multi-branching tree” as modified versions of “nearly balanced tree” of Saks and Wigderson, and we show recurrence formulas of randomized complexity for weakly balanced multi-branching trees
