Additional Metadata
THEME Life Sciences (theme 5), Logistics (theme 3)
Series quant-ph
Project Quantum Computing: algorithms, proofs and tradeoffs , Quantum computing: fault-tolerance, communication, and classical spin-offs
Note preprint
Citation
Ambainis, A, & de Wolf, R. M. (2012). How low can approximate degree and quantum query complexity be for total Boolean functions?. quant-ph.