The following pages link to STACS 2004 (Q5309733):
Displaying 8 items.
- Limits on the computational power of random strings (Q1951574) (← links)
- On the computational power of random strings (Q2271990) (← links)
- Polynomial clone reducibility (Q2436621) (← links)
- What can be efficiently reduced to the Kolmogorov-random strings? (Q2576937) (← links)
- Randomness is hard (Q2706121) (← links)
- Reductions to the set of random strings: the resource-bounded case (Q2878751) (← links)
- On the Polynomial Depth of Various Sets of Random Strings (Q3010430) (← links)
- Kolmogorov complexity, circuits, and the strength of formal theories of arithmetic (Q5414624) (← links)
