The following pages link to (Q3221885):
Displaying 17 items.
- Sensitivity vs. block sensitivity (an average-case study) (Q671409) (← links)
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates (Q672256) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- An extension of Khrapchenko's theorem (Q753798) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- On the complexity of slice functions (Q1066866) (← links)
- On monotone simulations on nonmonotone networks (Q1121853) (← links)
- A hierarchy of propositional Horn formuls (Q1122571) (← links)
- The slice map problem and approximation properties (Q1180632) (← links)
- Lower bounds on the area complexity of Boolean circuits (Q1193877) (← links)
- The multiplicative complexity of quadratic boolean forms (Q1199694) (← links)
- Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC (Q1317485) (← links)
- Optimal bounds for the approximation of Boolean functions and some applications (Q1390872) (← links)
- Graph complexity and slice functions (Q1405800) (← links)
- Bent functions and random Boolean formulas (Q1910518) (← links)
- Interior and exterior functions of Boolean functions (Q1923581) (← links)
- The powerset operator on abstract interpretations (Q1960538) (← links)
