Abstract
An ordered binary decision diagram (OBDD) is a graph representation of a Boolean function. In this paper, the size of ordered binary decision diagrams representing threshold functions is discussed. We consider two cases: the case when an ordering of variables is given and the case when it is adaptively chosen. We show 1) O(2n/2) upper bound for both cases, 2) ω(2n/2) lower bound for the former case and 3) ω(n2√n/2) lower bound for the latter case.
Cite
CITATION STYLE
Hosaka, K., Takenaga, Y., & Yajima, S. (1994). On the size of ordered binary decision diagrams representing threshold functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 584–592). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_226
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
