✦ LIBER ✦

On the complexity of minimizing the OBDD size for incompletely specified functions

✍ Scribed by Sauerhoff, M.; Wegener, I.

Book ID: 119778072
Publisher: IEEE
Year: 1996
Tongue: English
Weight: 359 KB
Volume: 15
Category: Article
ISSN: 0278-0070
DOI: 10.1109/43.543775

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimization of incompletely spec

On the minimization of incompletely specified fuzzy functions

✍ Abraham Kandel 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 530 KB

On the size of (generalized) OBDDs for t

On the size of (generalized) OBDDs for threshold functions

✍ Beate Bollig 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 154 KB

Lower bounds on the OBDD size of two fun

Lower bounds on the OBDD size of two fundamental functions' graphs

✍ Daniel Sawitzki 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 155 KB

A method for minimizing the number of st

A method for minimizing the number of states for a restricted class of incompletely specified sequential machines

✍ Ioan Tomescu 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 139 KB

On the size of randomized OBDDs and read

On the size of randomized OBDDs and read-once branching programs for k-stable functions

✍ M. Sauerhoff 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 392 KB

Variable orderings and the size of OBDDs

Variable orderings and the size of OBDDs for random partially symmetric Boolean functions

✍ Detlef Sieling 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB 👁 3 views

The size of ordered binary decision diagrams OBDDs strongly depends on the chosen variable ordering. It is an obvious heuristic to use symmetric variable orderings, i.e., variable orderings where symmetric variables are arranged adjacently. In order to evaluate this heuristic, methods for estimating