Pages that link to "Item:Q4431436"
From MaRDI portal
The following pages link to On the noise sensitivity of monotone functions (Q4431436):
Displayed 12 items.
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- Learning random monotone DNF (Q628302) (← links)
- On the nonlinearity of monotone Boolean functions (Q1667447) (← links)
- Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome? (Q1700408) (← links)
- Exclusion sensitivity of Boolean functions (Q1950376) (← links)
- Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
- Learning juntas in the presence of noise (Q2382279) (← links)
- Quantitative relation between noise sensitivity and influences (Q2448963) (← links)
- A Polynomial Lower Bound for Testing Monotonicity (Q4994983) (← links)
- Probabilistic view of voting, paradoxes, and manipulation (Q5081545) (← links)
- Annihilation and coalescence on binary trees (Q5170135) (← links)
- Approximating the Noise Sensitivity of a Monotone Boolean Function (Q5875511) (← links)