Tree Representations for Boolean Formulae with Commutativity and Assocaitivity.
Tenth Seminar on Analysis of Algorithms
June 14, 2004 01:00 PM to 02:00 PM
Speakers:
|
 |
Abstract: |
We study several tree representations of boolean functions, to take into account commutativity or associativity of the boolean operators. We show how we can define related probability distributions on boonlean functions, and study some relationships between these distributions. We also consider the relation to boolean function complexity. |
Keywords: |
Analysis of algorithms; Boolean function representation; probability distributions on boolean functions. |
|
|
