Optimal proof systems and sparse sets

2000

Presented at the International Symposium on Theoretical Aspects of Computer Science, Lille

Additional Metadata
MSC	Complexity classes (hierarchies, relations among complexity classes, etc.) (msc 68Q15), Complexity of proofs (msc 03F20)
Publisher	Springer
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., Fenner, S., Fortnow, L., & van Melkebeek, D. (2000). Optimal proof systems and sparse sets. In Proceedings of International Symposium on Theoretical Aspects of Computer Science 2000 (pp. 407–418). Springer.

Publication