Pages that link to "Item:Q1854567"

The following pages link to On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567):

Displaying 3 items.

• 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)