论文信息 - On the complexity of comparison problems using linear functions

On the complexity of comparison problems using linear functions

3. Summary of Results Ig 19 n-19 Ig(k/n) + 0(1) if k > n n/k + Ig 19 k + 0(1) if k < n We shall prove Theorems 1 and 2 in Sections 4 and 5. The proof of Theorem 3 is in the same vein and will not be given here.

Andrew Chi-Chih Yao | A. Yao

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

[2] Edward M. Reingold,et al. Computing the Maximum and the Median , 1971, SWAT.

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

[4] Leslie G. Valiant,et al. Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[5] David Galer Kirkpatrick,et al. Topics in the complexity of combinatorial algorithms. , 1974 .

[6] Victor Klee,et al. Spira's Theorems on Complete Linear Proofs of Systems of Linear Inequalities. , 1975 .

[7] Nathan Friedman,et al. Some Results on the Effect of Arithmetics on Comparison Problems , 1972, SWAT.

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

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

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