Size of OBDD representation of 2-level redundancies functions

DOI10.1016/S0304-3975(00)00368-6zbMath0974.68018MaRDI QIDQ5941091

Macha Nikolskaïa, L. Nikolskaia

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

reliabilityBoolean functionsbinary decision diagramssize complexity

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• A simple function that requires exponential size read-once branching programs
• Symbolic model checking: \(10^{20}\) states and beyond
• OBDDs of a monotone function and its prime implicants
• Size of ordered binary decision diagrams representing threshold functions
• A very simple function that requires exponential size read-once branching programs.
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams