Pages that link to "Item:Q1854567"
From MaRDI portal
The following pages link to On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567):
Displaying 9 items.
- On approximation by \(^{\oplus}\)-OBDDs (Q845954) (← links)
- Approximating Boolean functions by OBDDs (Q867861) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- On the influence of the variable ordering for algorithmic learning using OBDDs (Q2568437) (← links)
- (Q3002761) (← links)
- (Q4530740) (← links)
- (Q5150421) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311101) (← links)
- On the size of randomized OBDDs and read-once branching programs for \(k\)-stable functions (Q5957726) (← links)