An and–or tree is a graphical representation of the reduction of problems (or goals) to conjunctions and disjunctions of subproblems (or subgoals).

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Alexander A. Sherstov
- Theory of Computing
- 2013

The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f within 1=3 at every… (More)

Is this relevant?

2013

2013

- Xi Song, Tianfu Wu, Yunde Jia, Song-Chun Zhu
- 2013 IEEE Conference on Computer Vision and…
- 2013

This paper presents a method of learning reconfigurable And-Or Tree (AOT) models discriminatively from weakly annotated data for… (More)

Is this relevant?

2012

2012

- Jungseock Joo∗a, Shuo Wang†b, Song-Chun Zhu‡a
- 2012

A natural scene is composed of many components. See the example of the scene of beach in Figure 2. When we look at this image… (More)

Is this relevant?

2012

2012

- Liang Lin, Xiaolong Wang, Wei Yang, Jian-Huang Lai
- 2012 IEEE Conference on Computer Vision and…
- 2012

This paper proposes a simple yet effective method to learn the hierarchical object shape model consisting of local contour… (More)

Is this relevant?

2006

2006

- Russell Greiner, Ryan B. Hayward, Magdalena Jankowska, Michael Molloy
- Artif. Intell.
- 2006

Many tasks require evaluating a specified Boolean expression over a set of probabilistic tests whose costs and success… (More)

Is this relevant?

2005

2005

We consider two probability distributions on Boolean functions defined in terms of their representations by and/or trees (or… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Andris Ambainis
- Theory of Computing
- 2005

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric… (More)

Is this relevant?

2002

2002

- Russell Greiner, Ryan B. Hayward, Michael Molloy
- AAAI/IAAI
- 2002

Many tasks require evaluating a specified boolean expression φ over a set of probabilistic tests where we know the probability… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Michael Luby, Michael Mitzenmacher, Amin Shokrollahi
- SODA
- 1998

We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools… (More)

Is this relevant?

1991

1991

Independent and-parallelism, dependent and-parallelism and or-parallelism are the three main forms of implicit parallelism… (More)

Is this relevant?