Random strings make hard instances

1996

Presented at the Structure in Complexity Theory, Annual Conference, Amsterdam

Additional Metadata
MSC	Complexity classes (hierarchies, relations among complexity classes, etc.) (msc 68Q15), Algorithmic information theory (Kolmogorov complexity, etc.) (msc 68Q30)
Publisher	Springer
Journal	Journal of Computer Science and Technology
Conference	Structure in Complexity Theory, Annual Conference
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., & Orponen, P. (1996). Random strings make hard instances. In Journal of Computer Science and Technology (Vol. 53, pp. 261–266). Springer.

Publication