Randomness is hard

2000

SIAM Journal on Computing , Volume 30 - Issue 5 p. 1485- 1501

Additional Metadata
MSC	Complexity classes (hierarchies, relations among complexity classes, etc.) (msc 68Q15), 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., & Torenvliet, L. (2000). Randomness is hard. SIAM Journal on Computing, 30(5), 1485–1501.

Publication