Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICALP
/
Paper
A Quantum Lower Bound for the Query Complexity of Simon's Problem.
Pascal Koiran
,
Vincent Nesme
,
Natacha Portier
Venue
A*
ICALP
Year
2005
Proceedings
ICALP
DBLP record
conf/icalp/KoiranNP05 ↗
Browse the full
ICALP paper archive
.