On the BDD of a random boolean function

Authors:
Jean Vuillemin;Fredéric Béal
Affiliations:
Ecole Normale Supérieure, Paris, France;Ecole Normale Supérieure, Paris, France
Venue:
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Year:
2004

Citing 6
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The complexity of Boolean functions

The complexity of Boolean functions
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Verification of arithmetic circuits with binary moment diagrams

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract)

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Universal lossless compression via multilevel pattern matching

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Binary Decision Diagram BDD, the Binary Moment Diagram BMD and the Minimal Deterministic Automaton MDA are three canonical representations for Boolean functions. Exact expression a(i) and w(i) are provided for the average and worst size BDD over ${B^i}\rightarrowtail B$, and they are proved equal to those for the average and worst size BMD.