The following pages link to On random hard sets for NP (Q1917082):
Displaying 4 items.
- Random CNF's are hard for the polynomial calculus (Q626686) (← links)
- Unimodality, independence lead to NP-hardness of interval probability problems (Q877251) (← links)
- Correlation of NP-sets and co-NP-sets with respect to a random oracle (Q1901894) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)