Using autoreducibility to separate complexity classes

1995

Presented at the Annual IEEE Symposium on Foundations of Computer Science, Milwaukee, WI

Additional Metadata
MSC	Complexity classes (hierarchies, relations among complexity classes, etc.) (msc 68Q15), Complexity of computation (including implicit computational complexity) (msc 03D15)
Publisher	IEEE Comput. Soc. Press (Los Alamitos, CA)
Conference	Annual IEEE Symposium on Foundations of Computer Science
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., & Torenvliet, L. (1995). Using autoreducibility to separate complexity classes. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science (FOCS) (36) (pp. 520–527). IEEE Comput. Soc. Press (Los Alamitos, CA).

Publication