✦ LIBER ✦

The equivalence of Horn and network complexity for Boolean functions

✍ Scribed by Stal O. Anderaa; Egon Börger

Publisher: Springer-Verlag
Year: 1981
Tongue: English
Weight: 268 KB
Volume: 15
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00289267

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 3n-lower bound on the network complexi

A 3n-lower bound on the network complexity of Boolean functions

✍ C.P. Schnorr 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 972 KB

The network complexity and the Turing ma

The network complexity and the Turing machine complexity of finite functions

✍ C. P. Schnorr 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 745 KB

On the complexity of analysis and manipu

On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs

✍ Jordan Gergov; Christoph Meinel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 590 KB

On lower bounds for the complexity of di

On lower bounds for the complexity of disjunctive normal forms of Boolean functions with a small number of zeros

✍ A.Yu. Kogan 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 510 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

A comparison of the complexity of the lo

A comparison of the complexity of the longest and shortest disjunctive normal forms and a lower bound for the number of prime disjunctive normal forms for almost all Boolean functions

✍ A. D. Korshunov 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 690 KB