Name
Abstract | ||
|---|---|---|
Allender, Friedman, and Gasarch recently proved an upper bound of PSPACE for the class DTTRK of decidable languages that are polynomial-time truth-table reducible to the set of prefix-free Kolmogorov-random strings regardless of the universal machine used in the definition of Kolmogorov complexity. It is conjectured that DTTRK in fact lies closer to its lower bound BPP established earlier by Buhrman, Fortnow, Koucky, and Loff. It is also conjectured that we have similar bounds for the analogous class DTTRC defined by plain Kolmogorov randomness. In this paper, we provide further evidence for these conjectures. First, we show that the time-bounded analogue of DTTRC sits between BPP and PSPACE boolean AND P/poly. Next, we show that the class DTTRC, a obtained from DTTRC by imposing a restriction on the reduction lies between BPP and PSPACE. Finally, we show that the class P/R-C(=log) obtained by further restricting the reduction to ask queries of logarithmic length lies between BPP and Sigma(p)(2) boolean AND P/poly. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-662-44465-8_30 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
Kolmogorov complexity, randomness, truth-table reductions | Journal | 8635 |
Issue | ISSN | Citations |
1 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shuichi Hirahara | 1 | 7 | 3.48 |
| Akitoshi Kawamura | 2 | 0 | 0.34 |