Author:
Jain Rahul,Klauck Hartmut,Kundu Srijita,Lee Troy,Santha Miklos,Sanyal Swagato,Vihrovs Jevgēnijs
Funder
National Research Foundation Singapore
Agence Nationale de la Recherche
FP7 Ideas: European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference14 articles.
1. Aaronson, S.: Quantum certificate complexity. J. Comput. Syst. Sci. 74(3), 313–322 (2008)
2. Aaronson, S., Ben-David, S., Kothari, R.: Separations in query complexity using cheat sheets. In: Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing, STOC’16, pp. 863–876. ACM, New York (2016)
3. Ambainis, A., Kokainis, M., Kothari, R.: Nearly optimal separations between communication (or query) complexity and partitions. In: Proceedings of the 31St Conference on Computational Complexity, CCC’16, pp. 4:1–4:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Germany (2016)
4. Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. J. ACM 48(4), 778–797 (2001)
5. Blum, M., Impagliazzo, R.: Generic oracles and oracle classes. In: Proceedings of the 28th annual symposium on foundations of computer science, SFCS’87, pp. 118–126. IEEE Computer Society, Washington (1987)