Resource-bounded Kolmogorov complexity revisited

Additional Metadata
MSC	Algorithmic information theory (Kolmogorov complexity, etc.) (msc 68Q30), Complexity classes (hierarchies, relations among complexity classes, etc.) (msc 68Q15)
Publisher	Springer
Editor	R. Reischuk (Rüdiger) , M. Morvan (Morvan)
Series	Lecture Notes in Computer Science
Conference	International Symposium on Theoretical Aspects of Computer Science
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., & Fortnow, L. (1997). Resource-bounded Kolmogorov complexity revisited. In R. Reischuk & M. Morvan (Eds.), STACS 97 (pp. 105–116). Springer.

Publication