Pages that link to "Item:Q1894709"
From MaRDI portal
The following pages link to Sensitivity vs. block sensitivity of Boolean functions (Q1894709):
Displaying 26 items.
- Pseudo-average block sensitivity equals average sensitivity (Q293418) (← links)
- Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables (Q294804) (← links)
- On the average sensitivity of the weighted sum function (Q413263) (← links)
- Computing Boolean functions from multiple faulty copies of input bits (Q596147) (← links)
- Sensitivity vs. block sensitivity (an average-case study) (Q671409) (← links)
- Boolean functions with low average sensitivity depend on few coordinates (Q1280280) (← links)
- Composition limits and separating examples for some Boolean function complexity measures (Q1701350) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions (Q1887146) (← links)
- Sensitivity versus block sensitivity of Boolean functions (Q1944916) (← links)
- Sensitivities and block sensitivities of elementary symmetric Boolean functions (Q2048184) (← links)
- Certificate complexity of elementary symmetric Boolean functions (Q2089681) (← links)
- Conflict complexity is lower bounded by block sensitivity (Q2219069) (← links)
- Maximal sensitivity of Boolean nested canalizing functions (Q2272408) (← links)
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture (Q2334869) (← links)
- Block sensitivity of weakly symmetric functions (Q2382286) (← links)
- Size of Sets with Small Sensitivity: A Generalization of Simon’s Lemma (Q2948459) (← links)
- (Q4608008) (← links)
- Certificate complexity and symmetry of nested canalizing functions (Q5024675) (← links)
- New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity (Q5090948) (← links)
- On the resolution of the sensitivity conjecture (Q5123060) (← links)
- Sensitivity Versus Certificate Complexity of Boolean Functions (Q5740174) (← links)
- Sensitivity, affine transforms and quantum communication complexity (Q5918933) (← links)
- Tight bounds on sensitivity and block sensitivity of some classes of transitive functions (Q5925611) (← links)
- The simplified weighted sum function and its average sensitivity (Q5964818) (← links)
- Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube (Q6162041) (← links)
