11 citations · 16 across the 6 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2024
Separation and Collapse of Equilibria Inequalities on AND-OR Trees without Shape Constraints
Fuki Ito, Toshio Suzuki
Herein, we investigate the zero-error randomized complexity, which is the least cost against the worst input, of AND-OR tree computation by imposing various restrictions on the alg…
cs.AI2014★ 11 cited
Equilibrium Points of an AND-OR Tree: under Constraints on Probability
Toshio Suzuki, Yoshinao Niida
We study a probability distribution d on the truth assignments to a uniform binary AND-OR tree. Liu and Tanaka [2007, Inform. Process. Lett.] showed the following: If d achieves th…