Pages that link to "Item:Q1887146"
From MaRDI portal
The following pages link to Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions (Q1887146):
Displaying 20 items.
- Pseudo-average block sensitivity equals average sensitivity (Q293418) (← links)
- An improved lower bound on the sensitivity complexity of graph properties (Q551172) (← links)
- Sensitivity vs. block sensitivity of Boolean functions (Q1894709) (← links)
- Sensitivity versus block sensitivity of Boolean functions (Q1944916) (← links)
- On block sensitivity and fractional block sensitivity (Q1992105) (← 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)
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← 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)
- (Q5089234) (← links)
- New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity (Q5090948) (← links)
- Sensitivity Versus Certificate Complexity of Boolean Functions (Q5740174) (← links)
- A tighter relation between sensitivity complexity and certificate complexity (Q5915958) (← links)
- Tight bounds on sensitivity and block sensitivity of some classes of transitive functions (Q5925611) (← links)