2007
DOI: 10.1109/ismvl.2007.49
|View full text |Cite
|
Sign up to set email alerts
|

Representations of Elementary Functions Using Edge-Valued MDDs

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
22
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
5
1

Relationship

5
1

Authors

Journals

citations
Cited by 14 publications
(22 citation statements)
references
References 23 publications
0
22
0
Order By: Relevance
“…Theorem 1 also holds for EVMDDs because an EVMDD is obtained by merging non-terminal nodes in an EVBDD. Note that the upper bound for l-restricted Mp-monotone increasing functions shown in Theorem 1 is equal to the upper bound for totally Mp-monotone increasing functions shown in [21]. This upper bound is much smaller than the worst-case upper bound, 2 n , which is reached by EVBDDs for power functions and polynomial functions [23].…”
Section: Definition 11mentioning
confidence: 73%
See 4 more Smart Citations
“…Theorem 1 also holds for EVMDDs because an EVMDD is obtained by merging non-terminal nodes in an EVBDD. Note that the upper bound for l-restricted Mp-monotone increasing functions shown in Theorem 1 is equal to the upper bound for totally Mp-monotone increasing functions shown in [21]. This upper bound is much smaller than the worst-case upper bound, 2 n , which is reached by EVBDDs for power functions and polynomial functions [23].…”
Section: Definition 11mentioning
confidence: 73%
“…Y+1 is an affine transformation of an M1-monotone increasing function [21]. As shown in Example 4, f (X, Y) = X Y+1 can be converted into an affine transformation of an extended 2-restricted M1-monotone increasing function.…”
Section: Example 5: 2-bit Precision Functionmentioning
confidence: 99%
See 3 more Smart Citations