%0 Conference Paper %1 conf/focs/Reichardt09 %A Reichardt, Ben %B FOCS %D 2009 %I IEEE Computer Society %K dblp %P 544-551 %T Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function. %U http://dblp.uni-trier.de/db/conf/focs/focs2009.html#Reichardt09 %@ 978-0-7695-3850-1

@inproceedings{conf/focs/Reichardt09, added-at = {2023-03-23T00:00:00.000+0100}, author = {Reichardt, Ben}, biburl = {https://www.bibsonomy.org/bibtex/27515aee1a5fbf268110578d852e4ae15/dblp}, booktitle = {FOCS}, crossref = {conf/focs/2009}, ee = {https://doi.ieeecomputersociety.org/10.1109/FOCS.2009.55}, interhash = {cc3cbf630b54f580b4f0622968cb7a0b}, intrahash = {7515aee1a5fbf268110578d852e4ae15}, isbn = {978-0-7695-3850-1}, keywords = {dblp}, pages = {544-551}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T14:07:10.000+0200}, title = {Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function.}, url = {http://dblp.uni-trier.de/db/conf/focs/focs2009.html#Reichardt09}, year = 2009 }