Pages that link to "Item:Q2800553"
From MaRDI portal
The following pages link to Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions (Q2800553):
Displaying 6 items.
- Boolean functions with low average sensitivity depend on few coordinates (Q1280280) (← links)
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture (Q2334869) (← links)
- Low-Sensitivity Functions from Unambiguous Certificates. (Q4638078) (← links)
- Pseudorandom generators for low sensitivity functions (Q4993293) (← links)
- Sensitivity Versus Certificate Complexity of Boolean Functions (Q5740174) (← links)
- A tighter relation between sensitivity complexity and certificate complexity (Q5915958) (← links)