Separating complexity classes using autoreducibility

2000

SIAM Journal on Computing , Volume 29 - Issue 5 p. 1497- 1520

Additional Metadata
MSC	Complexity classes (hierarchies, relations among complexity classes, etc.) (msc 68Q15), Complexity of computation (including implicit computational complexity) (msc 03D15), Models of computation (Turing machines, etc.) (msc 68Q05)
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., Fortnow, L., van Melkebeek, D., & Torenvliet, L. (2000). Separating complexity classes using autoreducibility. SIAM Journal on Computing, 29(5), 1497–1520.

Publication