Finite functions (in particular, Boolean functions) play a fundamental role in computer science and discrete mathematics. This book describes representations of Boolean functions that have small size for many important functions and which allow efficient work with the represented functions. The
Branching Programs and Binary Decision Diagrams: Theory and Applications (Monographs on Discrete Mathematics and Applications)
โ Scribed by Ingo Wegener
- Publisher
- SIAM
- Year
- 1987
- Tongue
- English
- Leaves
- 419
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
<p>Symbolic Boolean manipulation using binary decision diagrams (BDDs) has been successfully applied to a wide variety of tasks, particularly in very large scale integration (VLSI) computer-aided design (CAD). The concept of decision graphs as an abstract representation of Boolean functions dates ba
I wanted to learn about combinatorial optimization for a particular application in cluster analysis, and this book hit the mark. This is a clearly written overview of the application of general dynamic programming to cluster analysis, object sequencing and seriation, and other data analysis problems
I wanted to learn about combinatorial optimization for a particular application in cluster analysis, and this book hit the mark. This is a clearly written overview of the application of general dynamic programming to cluster analysis, object sequencing and seriation, and other data analysis problems