Pages that link to "Item:Q1399979"
From MaRDI portal
The following pages link to Approximation of boolean functions by combinatorial rectangles (Q1399979):
Displaying 8 items.
- Approximation of Boolean functions to Schaefer's classes (Q690760) (← links)
- Connecting knowledge compilation classes and width parameters (Q778533) (← links)
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs (Q1854567) (← links)
- Inner and outer rounding of Boolean operations on lattice polygonal regions (Q2575584) (← links)
- Bounds for the number of Boolean functions admitting affine approximations of a given accuracy (Q2997852) (← links)
- Bounds for the number of Boolean functions admitting quadratic approximations of given accuracy (Q4917414) (← links)
- (Q5090465) (← links)
- Perspective on complexity measures targeting read-once branching programs (Q6647765) (← links)