Pages that link to "Item:Q5740174"
From MaRDI portal
The following pages link to Sensitivity Versus Certificate Complexity of Boolean Functions (Q5740174):
Displaying 8 items.
- Alternation, sparsity and sensitivity: bounds and exponential gaps (Q2632012) (← links)
- Size of Sets with Small Sensitivity: A Generalization of Simon’s Lemma (Q2948459) (← links)
- New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity (Q5090948) (← links)
- On the resolution of the sensitivity conjecture (Q5123060) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5217824) (← links)
- Sensitivity Versus Certificate Complexity of Boolean Functions (Q5740174) (← links)
- Rainbow Coloring Hardness via Low Sensitivity Polymorphisms (Q5875467) (← links)
- A tighter relation between sensitivity complexity and certificate complexity (Q5915958) (← links)
