Optimal quantum query bounds for almost all 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 van Proceedings of 30th Annual Symposium on Theoretical Aspects of Computer Science (STACS'2013)
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., Backurs, A., Smotrovs, J., & de Wolf, R. (2012). Optimal quantum query bounds for almost all Boolean functions. quant-ph.

Publication