Laurent Bienvenu. Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity. In Wolfgang Thomas, Pascal Weil, editors, STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings. Volume 4393 of Lecture Notes in Computer Science, pages 260-271, Springer, 2007. [doi]
@inproceedings{Bienvenu07:1,
title = {Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity},
author = {Laurent Bienvenu},
year = {2007},
doi = {10.1007/978-3-540-70918-3_23},
url = {http://dx.doi.org/10.1007/978-3-540-70918-3_23},
tags = {Kolmogorov complexity},
researchr = {https://researchr.org/publication/Bienvenu07%3A1},
cites = {0},
citedby = {0},
pages = {260-271},
booktitle = {STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings},
editor = {Wolfgang Thomas and Pascal Weil},
volume = {4393},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-70917-6},
}