Author:
Koiran Pascal,Landes Jürgen,Portier Natacha,Yao Penghui
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Aaronson, S.: Lower bounds for local search by quantum arguments. In: Proc. STOC 2004, pp. 465–474. ACM Press, New York (2004)
2. Aaronson, S., Shi, Y.: Quantum Lower Bounds for the Collision and the Element Distinctness Problems. Journal of the ACM 51(4), 595–605 (2004)
3. Ambainis, A.: Polynomial degree vs. quantum query complexity. J. Comput. Syst. Sci. 72(2), 220–238 (2006)
4. Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Sampling Algorithms: lower bounds and applications. In: Proc. STOC 2001, pp. 266–275. ACM Press, New York (2001)
5. Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of the ACM 48(4), 778–797 (2001)