S. Iriyama, M. Ohya, I. V. Volovich, “On quantum algorithm for binary search and its computational complexity”, Open Systems & Information Dynamics, 2015, Volume 22, Issue 3, 1550019, 9 pp.

Open Systems & Information Dynamics

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Open Systems & Information Dynamics, 2015, Volume 22, Issue 3, 1550019, 9 pp.
DOI: https://doi.org/10.1142/S1230161215500195 (Mi osid1)

This article is cited in 2 scientific papers (total in 2 papers)

On quantum algorithm for binary search and its computational complexity

S. Iriyama^a, M. Ohya^a, I. V. Volovich^b

^a Tokyo University of Science, Japan
^b Steklov Mathematical Institute, Russia

Citations (2)

DOI: https://doi.org/10.1142/S1230161215500195

Received: 11.06.2014
Accepted: 11.08.2015

Bibliographic databases:

Document Type: Article

Language: English

Linking options:

https://www.mathnet.ru/eng/osid1

This publication is cited in the following 2 articles:

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles