Andris Ambainis. Polynomial Degree vs. Quantum Query Complexity. In 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings. pages 230, IEEE Computer Society, 2003. [doi]
Abstract is missing.