How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?
Crossref DOI link: https://doi.org/10.1007/s00037-014-0083-2
Published Online: 2014-05-09
Published Print: 2014-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ambainis, Andris
de Wolf, Ronald
Text and Data Mining valid from 2014-05-09