Author:
Ambainis Andris,Prūsis Krišjānis
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Ambainis, A.: Polynomial degree vs. quantum query complexity. J. Comput. Syst. Sci. 72(2), 220–238 (2006)
2. Lecture Notes in Computer Science;A. Ambainis,2014
3. Ambainis, A., Sun, X.: New separation between s(f) and bs(f). CoRR, abs/1108.3494 (2011)
4. Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288(1), 21–43 (2002)
5. Hatami, P., Kulkarni, R., Pankratov, D.: Variations on the Sensitivity Conjecture. Graduate Surveys, vol. 4. Theory of Computing Library (2011)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献