Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds

2006

Presented at the International Symposium on Theoretical Aspects of Computer Science

Additional Metadata
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., Torenvliet, L., & Unger, F. (2006). Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. In Proceedings of International Symposium on Theoretical Aspects of Computer Science 2006 (pp. 455–468).

Publication