Publication 1997 Issue No. 4 - April Abstract - Average and Worst Case Number of Nodes in Decision Diagrams of Symmetric Multiple-Valued Functions
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Jon T. Butler Articles by David S. Herscovici Articles by Tsutomu Sasao Articles by Robert J. Barton III
Average and Worst Case Number of Nodes in Decision Diagrams of Symmetric Multiple-Valued Functions
April 1997 (vol. 46 no. 4)
pp. 491-494
 ASCII Text x Jon T. Butler, David S. Herscovici, Tsutomu Sasao, Robert J. Barton III, "Average and Worst Case Number of Nodes in Decision Diagrams of Symmetric Multiple-Valued Functions," IEEE Transactions on Computers, vol. 46, no. 4, pp. 491-494, April, 1997.
 BibTex x @article{ 10.1109/12.588065,author = {Jon T. Butler and David S. Herscovici and Tsutomu Sasao and Robert J. Barton III},title = {Average and Worst Case Number of Nodes in Decision Diagrams of Symmetric Multiple-Valued Functions},journal ={IEEE Transactions on Computers},volume = {46},number = {4},issn = {0018-9340},year = {1997},pages = {491-494},doi = {http://doi.ieeecomputersociety.org/10.1109/12.588065},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - Average and Worst Case Number of Nodes in Decision Diagrams of Symmetric Multiple-Valued FunctionsIS - 4SN - 0018-9340SP491EP494EPD - 491-494A1 - Jon T. Butler, A1 - David S. Herscovici, A1 - Tsutomu Sasao, A1 - Robert J. Barton III, PY - 1997KW - Decision diagramsKW - BDDKW - symmetric functionsKW - multiple-valued functionsKW - complexityKW - asymptotic approximationKW - average case.VL - 46JA - IEEE Transactions on ComputersER -

Abstract—We derive the average and worst case number of nodes in decision diagrams of r-valued symmetric functions of n variables. We show that, for large n, both numbers approach ${\textstyle{{{n^r} \over {r\,!}}}}.$ For binary decision diagrams (r = 2), we compute the distribution of the number of functions on n variables with a specified number of nodes. Subclasses of symmetric functions appear as features in this distribution. For example, voting functions are noted as having an average of ${\textstyle{n^2} \over 6}$ nodes, for large n, compared to ${\textstyle{{{n^2} \over 2}}},$ for general binary symmetric functions.

[1] S.B. Akers, "Binary Decision Diagrams," IEEE Trans. Computers, vol. 27, no. 6, pp. 509-516, June 1978.
[2] R.E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, Vol. C-35, No. 8, Aug. 1986, pp. 667-690.
[3] J.T. Butler and T. Sasao, "Average Number of Nodes in Binary Decision Diagrams of Fibonacci Functions," The Fibonacci Quarterly, vol. 34.5, pp. 413-422, Nov. 1996.
[4] J.T. Butler, J.L. Nowlin, and T. Sasao, "Planarity in ROMDD's of Multiple-Valued Symmetric Functions," Proc. 26th Int'l Symp. Multiple-Valued Logic, pp. 236-241, May 1996.
[5] H. Fredricksen, "A Survey of Full Length Nonlinear Shift Register Cycle Algorithms," SIAM Review, vol. 24, no. 2, pp. 195-220, Feb. 1982.
[6] M. Heap, "On the Exact Ordered Binary Decision Diagram Size of Totally Symmetric Functions," J. Electronic Testing: Theory, Application, vol. 4, no. 2, pp. 191-195, May 1993.
[7] D.M. Miller, "Multiple-Valued Logic Design Tools," Proc. 23rd Int'l Symp. Multiple-Valued Logic, pp. 2-11, May 1993.
[8] D.E. Ross, K.M. Butler, and M.R. Mercer, "Exact Ordered Binary Decision Diagram Size When Representing Classes of Symmetric Functions," J. Electronic Testing: Theory, Application, vol. 2, pp. 243-259, 1991.
[9] T. Sasao, "Optimization of Multiple-Valued AND-EXOR Expressions Using Multiple-Place Decision Diagrams," Proc. 22nd Int'l Symp. Multiple-Valued Logic, pp. 451-458, May 1992.
[10] I. Wegener, "Optimal Decision Tree and One-Time-Only Branching Programs for Symmetric Boolean Functions," Information and Control, pp. 129-143, Aug./Sept. 1984.

Index Terms:
Decision diagrams, BDD, symmetric functions, multiple-valued functions, complexity, asymptotic approximation, average case.
Citation:
Jon T. Butler, David S. Herscovici, Tsutomu Sasao, Robert J. Barton III, "Average and Worst Case Number of Nodes in Decision Diagrams of Symmetric Multiple-Valued Functions," IEEE Transactions on Computers, vol. 46, no. 4, pp. 491-494, April 1997, doi:10.1109/12.588065
Usage of this product signifies your acceptance of the Terms of Use.