The following pages link to Smooth Boolean Functions are Easy (Q2800553):
Displaying 5 items.
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture (Q2334869) (← links)
- Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
- (Q4993293) (← links)
- Sensitivity Versus Certificate Complexity of Boolean Functions (Q5740174) (← links)
- A tighter relation between sensitivity complexity and certificate complexity (Q5915958) (← links)
