On characterizations of randomized computation using plain Kolmogorov complexity. Hirahara, S. & Kawamura, A. In Mathematical foundations of computer science 2014. Part II, volume 8635, of Lecture Notes in Comput. Sci., pages 348–359, 2014. Springer, Heidelberg.
On characterizations of randomized computation using plain Kolmogorov complexity [link]Paper  doi  bibtex   
@INPROCEEDINGS{HK14b,
  author = {Hirahara, Shuichi and Kawamura, Akitoshi},
  title = {On characterizations of randomized computation using plain {K}olmogorov
	complexity},
  booktitle = {Mathematical foundations of computer science 2014. {P}art {II}},
  year = {2014},
  volume = {8635},
  series = {Lecture Notes in Comput. Sci.},
  pages = {348--359},
  publisher = {Springer, Heidelberg},
  doi = {10.1007/978-3-662-44465-8_30},
  mrclass = {68W20 (68Q15 68Q30)},
  mrnumber = {3259639},
  owner = {Vasco},
  timestamp = {2015.09.18},
  url = {http://dx.doi.org/10.1007/978-3-662-44465-8_30}
}

Downloads: 0