Pages that link to "Item:Q5311101"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311101):
Displaying 8 items.
- On approximation by \(^{\oplus}\)-OBDDs (Q845954) (← links)
- Approximating Boolean functions by OBDDs (Q867861) (← links)
- Introduction to the OBDD algorithm for the ATP community (Q1332638) (← links)
- Approximation of Boolean functions by local search (Q1424790) (← links)
- Computation of signal output probability for Boolean functions represented by OBDD (Q1767902) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard (Q3591326) (← links)
- OBDD minimization based on two-level representation of Boolean functions (Q4571387) (← links)