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

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

Original language	English
Title of host publication	2013 IEEE Conference on Computational Complexity, 5-7 June 2013, Palo Alto : proceedings
Pages	179-184
Publication status	Published - 2013

OECD Field of Science

@inproceedings{ebe8b6adbe324c48932db1e22b010460,

title = "How low can approximate degree and quantum query complexity be for total boolean functions?",

author = "Andris Ambainis and \{Wolf Ronald\}, De",

year = "2013",

language = "English",

isbn = "978-0-7695-4997-2",

pages = "179--184",

booktitle = "2013 IEEE Conference on Computational Complexity, 5-7 June 2013, Palo Alto : proceedings",