Pages that link to "Item:Q1390872"
From MaRDI portal
The following pages link to Optimal bounds for the approximation of Boolean functions and some applications (Q1390872):
Displaying 16 items.
- On derandomization and average-case complexity of monotone functions (Q428873) (← links)
- Approximation of Boolean functions to Schaefer's classes (Q690760) (← links)
- Approximating Boolean functions by OBDDs (Q867861) (← links)
- Algebraically degenerate approximations of Boolean functions (Q891097) (← links)
- Reviewing bounds on the circuit size of the hardest functions (Q1041784) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- Approximation of Boolean functions by local search (Q1424790) (← links)
- Minimum \(\varepsilon\)-equivalent circuit size problem (Q1777423) (← links)
- Rates of minimization of error functionals over Boolean variable-basis functions (Q2583503) (← links)
- Upper Bounds on Boolean-Width with Applications to Exact Algorithms (Q2867092) (← links)
- Bounds for the number of Boolean functions admitting affine approximations of a given accuracy (Q2997852) (← links)
- (Q3115267) (← links)
- On approximation of maximally nonlinear Boolean functions by almost linear functions (Q4917412) (← links)
- Bounds for the number of Boolean functions admitting quadratic approximations of given accuracy (Q4917414) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311101) (← links)
- Database Support for Data Mining Applications (Q5717472) (← links)
