Kolmogorov random graphs and the incompressibility method

1999

SIAM Journal on Computing , Volume 29 - Issue 2 p. 590- 599

Additional Metadata
MSC	Random graphs (msc 05C80), Algorithmic information theory (Kolmogorov complexity, etc.) (msc 68Q30)
Publisher	SIAM
Journal	SIAM Journal on Computing
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	Buhrman, H., Li, M., Tromp, J., & Vitányi, P. (1999). Kolmogorov random graphs and the incompressibility method. SIAM Journal on Computing, 29(2), 590–599.

Publication