Average and worst case number of nodes in decision diagrams of symmetric multiple-valued functions
Loading...
Authors
Herscovici, David S.
Sasao, Tsutomu
Barton, Robert J.
Butler, Jon T.
Advisors
Second Readers
Subjects
Decision diagrams
BDD
symmetric functions
multiple-valued functions
complexity
asymptotic approximation
average case
BDD
symmetric functions
multiple-valued functions
complexity
asymptotic approximation
average case
Date of Issue
1997-04
Date
April 1997
Publisher
Language
Abstract
Type
Article
Description
IEEE Transactions on Computers, Vol. 46, No.4, pp. 491-494, April 1997.
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.
Series/Report No
Department
Department of Electrical and Computer Engineering
Organization
Identifiers
NPS Report Number
Sponsors
Funding
Format
Citation
J. T. Butler, D. S. Herscovici, T. Sasao and R. J. Barton, "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.