Optimal quantum query bounds for almost all Boolean functions

2013

Presented at the International Symposium on Theoretical Aspects of Computer Science

Additional Metadata
THEME	Other (theme 6)
Conference	International Symposium on Theoretical Aspects of Computer Science
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. (2013). Optimal quantum query bounds for almost all Boolean functions. In Proceedings of International Symposium on Theoretical Aspects of Computer Science 2013 (STACS 30) (pp. 446–453).

Publication