✦ LIBER ✦

Approximate Algorithms for Minimization of Binary Decision Diagrams on the Basis of Linear Transformations of Variables

✍ Scribed by A. Kolpakov; R. Kh. Latypov

Book ID: 111572417
Publisher: SP MAIK Nauka/Interperiodica
Year: 2004
Tongue: English
Weight: 278 KB
Volume: 65
Category: Article
ISSN: 0005-1179
DOI: 10.1023/b:aurc.0000030905.86714.ac

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for the transformat

Efficient algorithms for the transformation between different types of binary decision diagrams

✍ Petr Savický; Ingo Wegener 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 150 KB

Using genetic algorithms for the variabl

Using genetic algorithms for the variable ordering of Reed-Muller binary decision diagrams

✍ A.E.A Almaini; N Zhuang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 604 KB

On random orderings of variables for par

On random orderings of variables for parity ordered binary decision diagrams

✍ Petr Savický 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

## Ordered binary decision diagrams (OBDDs) are a model for representing Boolean functions. There is also a more powerful variant called parity OBDDs. The size of the representation of a given function depends in both these models on the chosen ordering of the variables. It is known that there are

Cultural algorithm for minimization of b

Cultural algorithm for minimization of binary decision diagram and its application in crosstalk fault detection

✍ Zhong-Liang Pan; Ling Chen; Guang-Zhao Zhang 📂 Article 📅 2010 🏛 Institute of Automation, Chinese Academy of Scienc 🌐 English ⚖ 473 KB

On the Descriptive and Algorithmic Power

On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams

✍ Stephan Waack 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 84 KB

Two Algorithms for Piecewise-Linear Cont

Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable

✍ Tomek, I. 📂 Article 📅 1974 🏛 IEEE 🌐 English ⚖ 593 KB