Šen, A. C., Uspenskij, V. A., & Vereščagin, N. K. (2017). Kolmogorov complexity and algorithmic randomness. American Mathematical Society.
Chicago Style (17th ed.) CitationŠen, Aleksandr Ch., Vladimir Andreevič Uspenskij, and Nikolaj K. Vereščagin. Kolmogorov Complexity and Algorithmic Randomness. Providence, Rhode Island: American Mathematical Society, 2017.
MLA (9th ed.) CitationŠen, Aleksandr Ch., et al. Kolmogorov Complexity and Algorithmic Randomness. American Mathematical Society, 2017.
Warning: These citations may not always be 100% accurate.