How good is the adversary lower bound ?
In this paper we discuss the strength of the adversary argument in establishing lower bounds on the complexity of certain sorting-type problems. The relationship between adversary argument and so called information theory argument is indicated and the efficiency of adversary argument relative to the type of comparisons involved in the computation of a problem is investigated. The results concern the effect of polynomial comparisons on lower bounds. In certain cases (MIN and MERGE problems) by using polynomial comparisons we are able to obtain assymptotically the same lower bounds as those established when comparisons without arithmetics are used.
KeywordsLower Bound Decision Problem Comparison Tree Automaton Theory Comparison Problem
Unable to display preview. Download preview PDF.
- 1.Dobkin, D., Lipton, R., On the Complexity of Computations under Varying Sets of Primitives. Automata Theory and Formal Languages 2nd GI Conference, Lecture Notes in Computer Science 33, Springer-Verlag (1975), 110–117.Google Scholar
- 2.Knuth, D.E., The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, Reading, Mass., 1973.Google Scholar
- 4.Kirkpatrick, D.G., Topics in the Complexity of Combinatorial Algorithms. Department of Computer Science, University of Toronto, Technical Report No. 74, 1974.Google Scholar
- 5.Rabin, M.O., Proving Simultaneous Positivity of Linear Forms, JCSS 6 (1972), 639–650.Google Scholar
- 6.Reingold, E.M., Computing the Maxima and the Median, 12th Annual Symposium on Switching and Automata Theory (1971), 216–218.Google Scholar
- 7.Ružička, P., The Influence of Arithmetics on the Complexity of Comparison Problems, Computing Research Centre, Bratislava, Technical Report (1977), 10–19 (in Slovak).Google Scholar
- 8.Yao, A. Ch., On the Complexity of Comparison Problems Using Linear Functions, 16th Annual Symposium on Foundations of Computer Science, (1976), 85–89.Google Scholar