Title of article
A lower bound for quantum search of an ordered list
Author/Authors
Harry Buhrman، نويسنده , , Ronald de Wolf، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1999
Pages
5
From page
205
To page
209
Keywords
lower bounds , computational complexity , binary search , quantum computing
Journal title
Information Processing Letters
Serial Year
1999
Journal title
Information Processing Letters
Record number
129087
Link To Document