by Samuel Kutin
Theory of Computing, Volume 1(2), pp. 29-36, 2005
Bibliography with links to cited articles
 Bob Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf: Quantum lower bounds by polynomials. In Proc. of the 39th IEEE FOCS, pp. 352–361, 1998. [FOCS:10.1109/SFCS.1998.743485, arXiv:quant-ph/9802049].
 Gilles Brassard, Peter Hřyer, and Alain Tapp: Quantum Cryptanalysis of Hash and Claw-Free Functions, volume 1380 of Lecture Notes in CS, pp. 163–169. Springer-Verlag, 1998. [LATIN:11bhjthw46dxl2qa, arXiv:quant-ph/9805082].
 Noam Nisan and Márió Szegedy: On the degree of boolean functions as real polynomials. Computational Complexity, 4:301–313, 1994. [STOC:129757].
 Ramamohan Paturi: On the degree of polynomials that approximate symmetric boolean functions. In Proc. of the 24th ACM STOC, pp. 468–474, 1992. [STOC:129758].
 Yaoyun Shi: Quantum lower bounds for the collision and the element distinctness problems. In Proc. of the 43th IEEE FOCS, pp. 513–519, 2002. [FOCS:10.1109/SFCS.2002.1181975, arXiv:quant-ph/0112086].
 Peter W. Shor: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484–1509, 1997. [SICOMP:29317].