Built on

Nothing clear enough to list yet.

Similar

Nothing clear enough to list yet.

Nothing clear enough to list yet.

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…

Reading the bibliography…

2007

Cleve, Richard, Gavinsky, Dmytro, Yonge-Mallo, David L.

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.

Nothing clear enough to list yet.

Nothing clear enough to list yet.

Nothing clear enough to list yet.

alphaXiv searches the wider corpus for related work and actual follow-ups.

alphaXiv is searching for related work…