1997
DOI: 10.1109/12.588065
|View full text |Cite
|
Sign up to set email alerts
|

Average and worst case number of nodes in decision diagrams of symmetric multiple-valued functions

Abstract: , "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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

1997
1997
2020
2020

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 12 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…Some works already deal with complexity issues of the partially symmetric Boolean functions [8] and the symmetric multivalued functions [6,11,12]. They show that decision diagrams [4,15] are well suited to benefit from symmetries and we enhance this further on with excellent results for symmetric multivalued functions.…”
Section: Introductionmentioning
confidence: 97%
See 1 more Smart Citation
“…Some works already deal with complexity issues of the partially symmetric Boolean functions [8] and the symmetric multivalued functions [6,11,12]. They show that decision diagrams [4,15] are well suited to benefit from symmetries and we enhance this further on with excellent results for symmetric multivalued functions.…”
Section: Introductionmentioning
confidence: 97%
“…So, their study gives directly the best size of any MDD representation. Another asset of symmetric functions is that their MDD have bounds [6,12] of small order, but no result expresses exactly the maximum size. No result provides functions achieving this maximum either.…”
Section: Introductionmentioning
confidence: 99%