Boolean Expression Diagrams

@article{Andersen2002BooleanED,
  title={Boolean Expression Diagrams},
  author={Henrik Reif Andersen and Henrik Hulgaard},
  journal={Inf. Comput.},
  year={2002},
  volume={179},
  pages={194-212}
}
This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) which can represent any Boolean circuit in linear space and still maintain many of the desirable properties of BDDs. Two algorithms are described for transforming a BED into a reduced ordered BDD. One closely mimics the BDD apply-operator while the other can exploit the structural information of the… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 80 citations. REVIEW CITATIONS

Topics

Statistics

0510'01'03'05'07'09'11'13'15'17
Citations per Year

80 Citations

Semantic Scholar estimates that this publication has 80 citations based on the available data.

See our FAQ for additional information.