1. D. Aharonov, V. Jones, Z. Landau, A polynomial quantum algorithm for approximating the Jones polynomial, in Proceedings of the 38th Annual ACM symposium on Theory of Computing, Seattle, 21–23 May 2006, pp. 427–436
2. A. Ambainis, Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210–239 (2007)
3. A. Ambainis, New developments in quantum algorithms, in Proceedings of Mathematical Foundations of Computer Science 2010. Lecture Notes in Computer Science, vol. 6281 (Springer, New York, 2010), pp. 1–11
4. E. Bombieri, The Riemann hypothesis, in The Millennium Prize Problems, ed. by J. Carlson, A. Jaffe, A. Wiles (Clay Mathematics Institute/American Mathematical Society, Providence, 2006), pp. 107–152 [8]: The Millennium Prize Problem (Clay Mathematical Institute and American Mathematical Society, Cambridge, 2006), pp. 105–124
5. C. Breuil, B. Conrad, F. Diamond, R. Taylor, On the modularity of elliptic curves over
ℚ
$$\mathbb{Q}$$
: wild 3-adic exercises. J. Am. Math. Soc. 14(4), 843–939 (2001)