Skip to main content
SpringerLink
Log in
SpringerLink
Log in

How good is the adversary lower bound ?

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1977 (MFCS 1977)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 53))

  • 136 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  3. Fredman, M.L., How Good is the Information Theory Bound for Sorting? Theoretical Computer Science 1 (1976), 355–361.

    Article  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 

Download references

Author information

Authors and Affiliations

  1. Computing Research Centre, Dúbravská 3, 885 31, Bratislava, Czechoslovakia

    Peter Ružička & Juraj Wiedermann

Authors
  1. Peter Ružička
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juraj Wiedermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ružička, P., Wiedermann, J. (1977). How good is the adversary lower bound ?. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_169

Download citation

  • DOI: https://doi.org/10.1007/3-540-08353-7_169

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08353-5

  • Online ISBN: 978-3-540-37285-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation