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
β Scribed by Ingo Wegener
- Publisher
- Society for Industrial Mathematics
- Year
- 1987
- Tongue
- English
- Leaves
- 419
- Series
- Monographs on Discrete Mathematics and Applications
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Subjects
ΠΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°;ΠΠΈΡΠΊΡΠ΅ΡΠ½Π°Ρ ΠΌΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°;
π SIMILAR VOLUMES
<p>For someone with a hammer the whole world looks like a nail. Within the last 10-13 years BinarΒ·y Decision Diagmms (BDDs) have become the state-of-the-art data structure in VLSI CAD for representation and maΒ nipulation of Boolean functions. Today, BDDs are widely used and in the meantime have als
<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
<p><span>This is the first book that sums up test-related modeling of digital circuits and systems by a new structural-decision-diagrams model. The model represents structural and functional information jointly and opens a new area of research.</span></p><p><span>The book introduces and discusses ap