The following pages link to Hardness amplification within NP (Q5901049):
Displaying 9 items.
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- The value of help bits in randomized and average-case complexity (Q2012180) (← links)
- Gaussian bounds for noise correlation of functions (Q2379368) (← links)
- Learning DNF from random walks (Q2568457) (← links)
- A PCP Characterization of AM (Q3012834) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- On the noise sensitivity of monotone functions (Q4431436) (← links)
- Direct Sum Testing (Q5348457) (← links)
- Approximating the Noise Sensitivity of a Monotone Boolean Function (Q5875511) (← links)