The following pages link to (Q4160379):
Displaying 16 items.
- Linear temporal logic symbolic model checking (Q465680) (← links)
- On the minimization of (complete) ordered binary decision diagrams (Q503467) (← links)
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- Graph driven BDDs -- a new data structure for Boolean functions (Q673788) (← links)
- Probabilistic verification of Boolean functions (Q685120) (← links)
- A lower bound for read-once-only branching programs (Q1107323) (← links)
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time (Q1144943) (← links)
- On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs (Q1330665) (← links)
- A linear time equivalence test for read-twice DNF formulas (Q1334630) (← links)
- Efficient data structures for Boolean functions (Q1344625) (← links)
- Learning from examples with unspecified attribute values. (Q1401919) (← links)
- The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
- A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy (Q2011643) (← links)
- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem (Q3599068) (← links)
- Restrictive Acceptance Suffices for Equivalence Problems (Q4504964) (← links)
- On the complexity of constructing optimal ordered binary decision diagrams (Q5096910) (← links)
