Additional Metadata
THEME Other (theme 6)
Publisher Birkhäuser
Persistent URL dx.doi.org/10.1007/s00037-014-0083-2
Journal Computational Complexity
Project Progress in quantum computing:Algorithms, communication, and applications , Quantum Algorithmics
Grant This work was funded by the European Commission 7th Framework Programme; grant id erc/615307 - Progress in quantum computing: Algorithms, communication, and applications (QPROGRESS)
Citation
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