A Counting Approach to Lower Bounds for Selection Problems

Lower bounds are derived on the number of comparisons to solve several well-known selection problems Among the problems are finding the t largest elements of a given set m order (Wt), finding the s smallest and t largest elements in order (We.t), and finding the tth largest element (Vt) The results follow from bounds for more general selection problems, where an arbitrary partml order is given The bounds for Wt and Vt generahze to the case where comparisons between hnear functions of the input are allowed The approach is to show that a comparison tree for a selection problem contains a number of trees for smaller problems, thus estabhshmg a lower bound on the number of leaves An equivalent approach uses an adversary, based on a numerical "chaos" function that measures the number of unknown relations

[1]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[2]  Arnold Schönhage,et al.  Finding the Median , 1976, J. Comput. Syst. Sci..

[3]  Vaughan R. Pratt,et al.  On Lower Bounds for Computing the i-th Largest Element , 1973, SWAT.

[4]  Philip M. Spira,et al.  Complete Linear Proofs of Systems of Linear Inequalities , 1972, J. Comput. Syst. Sci..

[5]  Andrew Chi-Chih Yao,et al.  On the complexity of comparison problems using linear functions , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[6]  Michael O. Rabin,et al.  Proving Simultaneous Positivity of Linear Forms , 1972, J. Comput. Syst. Sci..

[7]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[8]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[9]  Edward M. Reingold,et al.  On the Optimality of Some Set Algorithms , 1972, JACM.

[10]  Ira Pohl,et al.  A sorting problem and its complexity , 1972, CACM.

[11]  Laurent Hyafil.  Bounds for Selection , 1976, SIAM J. Comput..