Symbolic Manipulation of Boolean Functions Using a Graphical Representation
The work
| Authors | Randal E. Bryant |
|---|---|
| Editors | |
| Type | inproceedings |
| Year | 1985 |
| Also known as | bryant1985symbolicb |
| Citekey | bryant1985manipulation |
Where it appeared
| Published in | Proceedings of the 22nd ACM/IEEE Design Automation Conference (DAC '85) |
|---|
Identifiers
| DOI | 10.1109/dac.1985.1586017 |
|---|
From bibtex.
Abstract
In this paper we describe a 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 of Lee and Akers, 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 are quite efficient as long as the graphs being operated on do not grow too large. We present performance measurements obtained while applying these algorithms to problems in logic design verification.
A copy is held
pdf, 34.8 kB. Not published — it may be under copyright. The facts and links here are.
How it got here
| How it got here | agent via bibtex |
|---|---|
| Added | 2026-10-22 17:07 UTC |
| Approved by | a person 2026-10-22 22:42 UTC |
Filed under
Cite it as
@inproceedings{bryant1985manipulation,
title = {Symbolic Manipulation of Boolean Functions Using a Graphical Representation},
author = {Randal E. Bryant},
year = {1985},
booktitle = {Proceedings of the 22nd ACM/IEEE Design Automation Conference (DAC '85)},
doi = {10.1109/dac.1985.1586017},
}
This record lives at https://refs.drheap.org/bryant1985manipulation/ and will keep
doing so. It used to be called bryant1985symbolicb, and those addresses still resolve to this one.