What can be efficiently reduced to the Kolmogorov-random strings?

2006

Annals of Pure and Applied Logic , Volume 138 - Issue 1-3 p. 2- 19

Additional Metadata
Publisher	North-Holland
Journal	Annals of Pure and Applied Logic
Organisation	Quantum Computing and Advanced System Research
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Allender, E., Buhrman, H., & Koucký, M. (2006). What can be efficiently reduced to the Kolmogorov-random strings?. Annals of Pure and Applied Logic, 138(1-3), 2–19.

Publication