Publisher
Springer Berlin Heidelberg
Reference42 articles.
1. Alonso, L., Reingold, E. M., Schott, R.: Determining the majority. Information Processing Letters47 (1993) 253–255
2. Ambainis, A.: A better lower bound for quantum algorithms searching an ordered list. Proc. of 40th IEEE Symposium on Foundations of Computer Science (1999) 352–357
3. Ambainis, A.: Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences (to appear)
4. Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of the ACM (to appear)
5. Bennett, C. H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computation. SIAM Journal on Computing26 (1997) 1510–1523
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献