Graph-Based Algorithms for Boolean Function Manipulation Export

@article{citeulike:130315, abstract = {In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical...}, author = {Bryant, Randal E.}, citeulike-article-id = {130315}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5124}, journal = {\# ieeetc}, keywords = {binary-decision-diagram, homework-pas-1, lecture-pas}, month = {aug}, number = {\# 8}, pages = {677--691}, posted-at = {2008-11-18 23:04:12}, priority = {0}, title = {Graph-Based Algorithms for Boolean Function Manipulation}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5124}, volume = {C-35}, year = {\# 1986} }

TY - JOUR ID - citeulike:130315 L3 - citeulike-article-id:130315 N2 - In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical... IS - # 8 JF - # ieeetc EP - 691 TI - Graph-Based Algorithms for Boolean Function Manipulation VL - C-35 SP - 677 KW - binary-decision-diagram KW - homework-pas-1 KW - lecture-pas AU - Bryant, Randal PY - # 1986/# aug// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5124 ER -