On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
From MaRDI portal
Publication:1330665
DOI10.1016/0020-0190(94)00048-4zbMath0803.68049MaRDI QIDQ1330665
Christoph Meinel, Jordan Gergov
Publication date: 21 July 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00048-4
Boolean functions; data structures; CAD; branching programs; efficient algorithms; BDD; decision graphs; Boolean manipulation; computer-aided circuit design; computer-aided logic synthesis
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68U07: Computer science aspects of computer-aided design
Related Items
Learning ordered binary decision diagrams, On the hardness of approximating the minimum consistent acyclic DFA and decision diagram.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the size of binary decision diagrams representing Boolean functions
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
- Modified branching programs and their computational power
- Graph-Based Algorithms for Boolean Function Manipulation
- Binary Decision Diagrams