✦ LIBER ✦

On the size of (generalized) OBDDs for threshold functions

✍ Scribed by Beate Bollig

Book ID: 108154610
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 154 KB
Volume: 109
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2009.01.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On the OBDD size for graphs of bounded t

On the OBDD size for graphs of bounded tree- and clique-width

✍ Klaus Meer; Dieter Rautenbach 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 528 KB

On the Size of Weights for Threshold Gat

On the Size of Weights for Threshold Gates

✍ Håstad, Johan 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 932 KB

Optimal lower bounds on the depth of pol

Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions

✍ Ingo Wegener 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 176 KB