Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
FOCS
/
Paper
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function.
Ben Reichardt
Venue
A*
FOCS
Year
2009
Proceedings
FOCS
DBLP record
conf/focs/Reichardt09 ↗
Browse the full
FOCS paper archive
.