Skip to main content
Conference Proceedings

Quantum algorithms for evaluating min-max trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5106 LNCS 11-15
DOI: 10.1007/978-3-540-89304-2_2
9Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a bounded-error quantum algorithm for evaluating Min-Max trees with queries, where N is the size of the tree and where the allowable queries are comparisons of the form [x j ∈

Cite

CITATION STYLE

APA

Cleve, R., Gavinsky, D., & Yonge-Mallo, D. L. (2008). Quantum algorithms for evaluating min-max trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5106 LNCS, pp. 11–15). Springer Verlag. https://doi.org/10.1007/978-3-540-89304-2_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free