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]
@article{ECCC-TR04-044,
title = {What Can be Efficiently Reduced to the Kolmogorov-Random Strings?},
author = {Eric Allender and Harry Buhrman and Michal Koucký},
year = {2004},
url = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-044/index.html},
researchr = {https://researchr.org/publication/ECCC-TR04-044},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
number = {044},
}