How low can approximate degree and quantum query complexity be for total Boolean functions?

2014

Computational Complexity , Volume 23 - Issue 2 p. 305- 322

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 APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	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

Additional Files
23029B.pdf Author Manuscript , 124kb
Publisher Version

Publication