๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

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

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Branching Programs and Binary Decision D
โœ Ingo Wegener ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

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

Binary Decision Diagrams and Application
โœ Shin-ichi Minato (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 1996 ๐Ÿ› Springer US ๐ŸŒ English

<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

Combinatorial Data Analysis: Optimizatio
โœ Lawrence Hubert, Phipps Arabie, Jacqueline Meulman ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

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

Combinatorial Data Analysis: Optimizatio
โœ Lawrence Hubert, Phipps Arabie, Jacqueline Meulman ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

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