Quantum Algorithms for Evaluating MIN-MAX Trees

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantum Algorithms for Evaluating MIN-MAX Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Algorithms for Evaluating MIN-MAX Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Algorithms for Evaluating MIN-MAX Trees will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-14211

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.