How low can approximate degree and quantum query complexity be for total Boolean functions?

Additional Metadata
THEME	Life Sciences (theme 5), Logistics (theme 3)
Series	quant-ph
Project	Quantum Computing: algorithms, proofs and tradeoffs , Quantum computing: fault-tolerance, communication, and classical spin-offs
Note	preprint
Organisation	Algorithms and Complexity
Citation APA APA Style APA-ALL Style AAA 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. (2012). How low can approximate degree and quantum query complexity be for total Boolean functions?. In quant-ph (1206.0717).

Publication