Autors:

CiteWeb id: 19860000021

CiteWeb score: 10164

DOI: 10.1109/TC.1986.1676819

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 applications have a more reasonable representation. Our algorithms have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large. We present experimental results from applying these algorithms to problems in logic design verification that demonstrate the practicality of our approach.

The publication "Graph-Based Algorithms for Boolean Function Manipulation" is placed in the Top 1000 of the best publications in CiteWeb. Also in the category Computer Science it is included to the Top 1000. Additionally, the publicaiton "Graph-Based Algorithms for Boolean Function Manipulation" is placed in the Top 100 among other scientific works published in 1986.
Links to full text of the publication: