On characterizations of randomized computation using plain Kolmogorov complexity

Shuichi Hirahara, Akitoshi Kawamura

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)

抄録

Allender, Friedman, and Gasarch recently proved an upper bound of pspace for the class DTTR K 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 DTTR K in fact lies closer to its lower bound BPP established earlier by Buhrman, Fortnow, Koucký, and Loff. It is also conjectured that we have similar bounds for the analogous class DTTR C defined by plain Kolmogorov randomness. In this paper, we provide further evidence for these conjectures. First, we show that the time-bounded analogue of DTTR C sits between BPP and pspace ∩ P/poly. Next, we show that the class DTTR C, α obtained from DTTR C by imposing a restriction on the reduction lies between BPP and pspace. Finally, we show that the class P/R obtained by further restricting the reduction to ask queries of logarithmic length lies between BPP and P/poly.

本文言語英語
ホスト出版物のタイトルMathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings
出版社Springer Verlag
ページ348-359
ページ数12
PART 2
ISBN(印刷版)9783662444641
DOI
出版ステータス出版済み - 2014
外部発表はい
イベント39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014 - Budapest, ハンガリー
継続期間: 8 25 20148 29 2014

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
番号PART 2
8635 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014
国/地域ハンガリー
CityBudapest
Period8/25/148/29/14

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「On characterizations of randomized computation using plain Kolmogorov complexity」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル