Reductions to the set of random strings: The resource-bounded case

2014

Additional Metadata
THEME	Information (theme 2)
Stakeholder	Unspecified
Publisher	creative commons
Persistent URL	doi.org/10.2168/LMCS-10(3:5)2014
Journal	Logical Methods in Computer Science
Project	Networks
Grant	This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/024.002.003 - Networks
Organisation	Algorithms and Complexity
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., Friedman, L., & Loff Barreto, B. S. (2014). Reductions to the set of random strings: The resource-bounded case. Logical Methods in Computer Science. doi:10.2168/LMCS-10(3:5)2014

Publication