加载中…
2007-10-31
Quantum Algorithms for Evaluating MIN-MAX Trees
Richard CleveDmytro GavinskyDavid L. Yonge-Mallo
文献摘要
We present a bounded-error quantum algorithm for evaluating Min-Max trees. For a tree of size N our algorithm makes N^{1/2+o(1)} comparison queries, which is close to the optimal complexity for this problem.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本