Birkhäuser
doi.org/10.1007/s00037-014-0083-2
Computational Complexity
Progress in quantum computing:Algorithms, communication, and applications , Quantum Algorithmics
Algorithms and Complexity

Ambainis, A, & de Wolf, R.M. (2014). How low can approximate degree and quantum query complexity be for total Boolean functions?. Computational Complexity, 23(2), 305–322. doi:10.1007/s00037-014-0083-2