Least Upper Bounds for the Size of OBDDs Using Symmetry Properties

@article{HeinrichLitan2000LeastUB,
  title={Least Upper Bounds for the Size of OBDDs Using Symmetry Properties},
  author={Laura Heinrich-Litan and Paul Molitor},
  journal={IEEE Trans. Computers},
  year={2000},
  volume={49},
  pages={360-368}
}
ÐThis paper investigates reduced ordered binary decision diagrams (OBDD) of partially symmetric Boolean functions when using variable orders where symmetric variables are adjacent. We prove upper bounds for the size of such symmetry ordered OBDDs (SymOBDD). They generalize the upper bounds for the size of OBDDs of totally symmetric Boolean functions and nonsymmetric Boolean functions proven by Heap and Mercer [14], [15] and Wegener [37]. Experimental results based on these upper bounds show… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS