Minimum and maximum against k lies

Details Minimum and maximum against k lies Minimum and maximum against k lies

2010-02-02

arxiv.org/abs/1002.0562v1

Computer Science

Data Structures and Algorithms

11 pages, 3 figures

Scientific paper

A neat 1972 result of Pohl asserts that [3n/2]-2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an n-element totally ordered set. The set is accessed via an oracle for pairwise comparisons. More recently, the problem has been studied in the context of the Renyi-Ulam liar games, where the oracle may give up to k false answers. For large k, an upper bound due to Aigner shows that (k+O(\sqrt{k}))n comparisons suffice. We improve on this by providing an algorithm with at most (k+1+C)n+O(k^3) comparisons for some constant C. The known lower bounds are of the form (k+1+c_k)n-D, for some constant D, where c_0=0.5, c_1=23/32=0.71875, and c_k=\Omega(2^{-5k/4}) as k goes to infinity.

Affiliated with

Also associated with

No associations

Rating

Minimum and maximum against k lies 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 Minimum and maximum against k lies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum and maximum against k lies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-707035