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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers 35(8), 677–691 (1986)
Bryant, R.E.: Symbolic boolean manipulations with ordered binary decision diagrams. ACM Comp. Surveys 24, 293–318 (1992)
Bryant, R.E., Chen, Y.-A.: Verification of arithmetic functions with binary moment diagrams. In: Design Automation Conf., pp. 535–541 (1995)
Delange, H.: Sur la fonction sommatoire de la fonction somme des chiffres. Enseignement Math’ematique 21, 31–47 (1975)
Grőpl, C.: Binary Decision Diagrams for Random Boolean Functions, Dissertation, Humboldt University, Berlin, 126 p. (1999)
Grőpl, C., Prőmel, H.J., Srivastav, A.: Size and structure of random ordered binary decision diagrams. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 238–248. Springer, Heidelberg (1998)
Kiefer, J.C., Yang, E., Nelson, G.J., Cosman, P.: Universal lossless compression via multilevel pattern matching. IEEE Transactions on Information Theory 46, 1227–1245 (2000)
Knuth, D.E.: The Art of Computer Programming, vol. 3, Sorting and Searching. Addison-Wesley, Reading (1971)
MapleSoft. Maple 9 Guide. Waterloo Maple Inc. (2003)
Wegener, I.: The Complexity of Boolean Functions. John Wiley and Sons Ltd., Chichester (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vuillemin, J., Béal, F. (2004). On the BDD of a Random Boolean Function. In: Maher, M.J. (eds) Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making. ASIAN 2004. Lecture Notes in Computer Science, vol 3321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30502-6_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-30502-6_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24087-7
Online ISBN: 978-3-540-30502-6
eBook Packages: Computer ScienceComputer Science (R0)