Quantum proofs for classical theorems. IEEE Conference on Computational Complexity: How low can approximate degree and quantum query complexity be for total boolean functions?  Palo Alto, CA, USA

Additional Metadata
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	de Wolf, R. (2013, January). Quantum proofs for classical theorems. IEEE Conference on Computational Complexity: How low can approximate degree and quantum query complexity be for total boolean functions? Palo Alto, CA, USA.

Publication