The following pages link to Randomness is hard (Q2706121):
Displaying 9 items.
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- Time-bounded incompressibility of compressible strings and sequences (Q989573) (← links)
- Random languages for nonuniform complexity classes (Q1179458) (← links)
- Good random number generators are (not so) easy to find (Q1299872) (← links)
- Randomness is inherently imprecise (Q2069032) (← links)
- Resource-bounded Kolmogorov complexity revisited (Q2784486) (← links)
- Resource-bounded kolmogorov complexity revisited (Q5047163) (← links)
- THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS (Q5462667) (← links)
- Enumerations of the Kolmogorov function (Q5480623) (← links)