Eric Allender, Harry Buhrman, Michal Koucký. What Can be Efficiently Reduced to the K-Random Strings?. In Volker Diekert, Michel Habib, editors, STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings. Volume 2996 of Lecture Notes in Computer Science, pages 584-595, Springer, 2004. [doi]
Abstract is missing.