Skip to content

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers · 1986 · 8,863 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Bryant. (1986). Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8), 677–691. https://doi.org/10.1109/tc.1986.1676819

In text: (Bryant, 1986)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

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 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.

  1. Formal principles of language acquisition . By Kenneth Wexler and Peter W. Culicover. Cambridge, MA: MIT Press, 1980. Pp. xvii, 647. $35.00.1982

Metadata from OpenAlex (CC0). Citations are generated from the published record.