Binary decision diagrams in theory and practice
β Scribed by Rolf Drechsler; Detlef Sieling
- Publisher
- Springer
- Year
- 2001
- Tongue
- English
- Weight
- 447 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1433-2779
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider translation among conjunctive normal forms (CNFs), characteristic models, and ordered binary decision diagrams (OBDDs) of Boolean functions. It is shown in this paper that Horn OBDDs can be translated into their Horn CNFs in polynomial time. As for the opposite direction, the problem can
## 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