Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference32 articles.
1. A. Aaronson, Lower bounds for local search by quantum arguments, Proceedings of STOC’04, 2004, pp. 465–474, also quant-ph/0307149.
2. Quantum lower bounds for the collision and the element distinctness problems;Aaronson;J. ACM,2004
3. Quantum lower bounds by quantum arguments;Ambainis;J. Comput. System Sci.,2002
4. A. Ambainis, Polynomial degree and lower bounds in quantum complexity: collision and element distinctness with small range, Theory of Computing 1 (2005) 37–46, als quantph/0305179.
5. A. Ambainis, Quantum query algorithms and lower bounds. Proceedings of FOTFS’III, Trends in Logic, Kluwer Academic Publishers, 23 (2004) 15–32.
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献