What Can be Efficiently Reduced to the Kolmogorov-Random Strings?

Eric Allender, Harry Buhrman, Michal Koucký. What Can be Efficiently Reduced to the Kolmogorov-Random Strings?. Electronic Colloquium on Computational Complexity (ECCC), (044), 2004. [doi]

Abstract

Abstract is missing.