Andris Ambainis, Ronald de Wolf. How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?. In Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, California, USA, 5-7 June, 2013. pages 179-184, IEEE, 2013. [doi]
Abstract is missing.