Graph-Based Algorithms for Boolean Function Manipulation

@article{Bryant1986GraphBasedAF,
  title={Graph-Based Algorithms for Boolean Function Manipulation},
  author={R. Bryant},
  journal={IEEE Transactions on Computers},
  year={1986},
  volume={C-35},
  pages={677-691}
}
  • R. Bryant
  • Published 1986
  • Computer Science
  • IEEE Transactions on Computers
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… Expand
7,527 Citations
Graph-Based Representations of Discrete Functions
  • 44
Randomized OBDD-based graph algorithms
  • Marc Bury
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 2018
Randomized OBDD-Based Graph Algorithms
  • Marc Bury
  • Mathematics, Computer Science
  • SIROCCO
  • 2015
  • 1
Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks
  • B. Bollig
  • Mathematics, Computer Science
  • MFCS
  • 2010
  • 6
Boolean technology mapping based on logic decomposition
  • 4
  • Highly Influenced
  • PDF
Implicit computation of maximum bipartite matchings by sublinear functional operations
  • 7
Exploiting communication complexity for Boolean matching
  • K. Wang, T. Hwang, C. Chen
  • Mathematics, Computer Science
  • IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 1996
  • 15
  • PDF
On Symbolic Representations of Maximum Matchings and (Un)directed Graphs
  • B. Bollig
  • Mathematics, Computer Science
  • IFIP TCS
  • 2010
  • 7
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
The Design and Analysis of Computer Algorithms
  • 9,245
  • PDF
Computers and Intractability: A Guide to the Theory of NP-Completeness
  • 47,467
  • PDF
Binary Decision Diagrams
  • S. Akers
  • Computer Science
  • IEEE Transactions on Computers
  • 1978
  • 1,437
  • PDF
Majority Gate Networks
  • 80
Decision Trees and Diagrams
  • 336
Representation of switching circuits by binary-decision programs
  • 790
The Area-Time Complexity of Binary Multiplication
  • 211
  • PDF
A Suggestion for a Fast Multiplier
  • 556
A symbolic analysis of relay and switching circuits
  • C. Shannon
  • Computer Science
  • Transactions of the American Institute of Electrical Engineers
  • 1938
  • 904
  • Highly Influential
  • PDF
...
1
2
3
...