On the sensitivity conjecture
From MaRDI portal
Recommendations
- Sensitivity versus certificate complexity of Boolean functions
- Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions
- Tighter relations between sensitivity and other complexity measures
- Sensitivity vs. block sensitivity of Boolean functions
- On the sensitivity conjecture for disjunctive normal forms
Cited in
(32)- A tight lower bound on certificate complexity in terms of block sensitivity and sensitivity
- On block sensitivity and fractional block sensitivity
- On the resolution of the sensitivity conjecture
- scientific article; zbMATH DE number 1314933 (Why is no real title available?)
- Sensitivity of the Hermite rank
- Size of sets with small sensitivity: a generalization of Simon's lemma
- On the sensitivity of cyclically-invariant Boolean functions
- On the sensitivity conjecture for disjunctive normal forms
- A tighter relation between sensitivity complexity and certificate complexity
- A tighter relation between sensitivity complexity and certificate complexity
- On the relation between partial balance and insensitivity
- Sensitivity versus block sensitivity of Boolean functions
- The equivalence of two problems on the cube
- Alternation, sparsity and sensitivity: bounds and exponential gaps
- Alternation, sparsity and sensitivity: combinatorial bounds and exponential gaps
- Sensitivity versus certificate complexity of Boolean functions
- scientific article; zbMATH DE number 176974 (Why is no real title available?)
- The average sensitivity of bounded-depth formulas
- Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions
- Inducing sensitivity on hyperspaces
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- Tighter relations between sensitivity and other complexity measures
- On the sensitivity conjecture for read-k formulas
- Low-sensitivity functions from unambiguous certificates
- On the sensitivity complexity of bipartite graph properties
- Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions
- The sensitivity question under some restrained conditions
- Sensitivity vs. block sensitivity of Boolean functions
- A New Approach to the Sensitivity Conjecture
- A communication game related to the sensitivity conjecture
- Tight bounds on sensitivity and block sensitivity of some classes of transitive functions
- Properties and applications of Boolean function composition
This page was built for publication: On the sensitivity conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598175)
