2013
Optimal quantum query bounds for almost all Boolean functions
Publication
Publication
Presented at the
International Symposium on Theoretical Aspects of Computer Science
Additional Metadata | |
---|---|
International Symposium on Theoretical Aspects of Computer Science | |
Organisation | Algorithms and Complexity |
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). |