How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?

Additional Metadata
THEME	Other (theme 6)
Conference	IEEE Conference on Computational Complexity
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	Ambainis, A., & de Wolf, R. (2013). How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?. In Proceedings of IEEE Conference on Computational Complexity 2013 (CCC 28).

Publication