DeepAI AI Chat
Log In Sign Up

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2

by   Mika Shigemizu, et al.
Tokyo Metropolitan University

We investigate an AND-OR tree T and a probability distribution d on the truth assignments to the leaves. Tarsi (1983) showed that if d is an independent and identical distribution (IID) such that probability of a leaf having value 0 is neither 0 nor 1 then, under a certain assumptions, there exists an optimal algorithm that is depth-first. We investigate the case where d is an independent distribution (ID) and probability depends on each leaf. It is known that in this general case, if height is greater than or equal to 3, Tarsi-type result does not hold. It is also known that for a complete binary tree of height 2, Tarsi-type result certainly holds. In this paper, we ask whether Tarsi-type result holds for an AND-OR tree of height 2. Here, a child node of the root is either an OR-gate or a leaf: The number of child nodes of an internal node is arbitrary, and depends on an internal node. We give an affirmative answer. Our strategy of the proof is to reduce the problem to the case of directional algorithms. We perform induction on the number of leaves, and modify Tarsi's method to suite height 2 trees. We discuss why our proof does not apply to height 3 trees.


page 1

page 2

page 3

page 4


Equilibrium Points of an AND-OR Tree: under Constraints on Probability

We study a probability distribution d on the truth assignments to a unif...

Non-Depth-First Search against Independent Distributions on an AND-OR Tree

Suzuki and Niida (Ann. Pure. Appl. Logic, 2015) showed the following res...

Drawing Halin-graphs with small height

In this paper, we study how to draw Halin-graphs, i.e., planar graphs th...

A fast algorithm for constructing balanced binary search trees

We suggest a new non-recursive algorithm for constructing a binary searc...

Depth-First Search performance in a random digraph with geometric outdegree distribution

We present an analysis of the depth-first search algorithm in a random d...

Improved Strong Spatial Mixing for Colorings on Trees

Strong spatial mixing (SSM) is a form of correlation decay that has play...

Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too

The bamboo trimming problem considers n bamboo with growth rates h_1, h_...