CIE
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We show the following results for polynomial-time reducibility to RC , the set of Kolmogorov random strings.
63
Voted
COCO
2010
Springer
15 years 23 days ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...