Skip to main content
Log in

On the number of relational operators necessary to compute certain functions of real variables

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The famous result of N. Friedman that any sorting algorithm uses at least O(n log n) relational operations in the worst case, even if the real number operations +,−,*, / can be used without any time account, is extended and generalized. Our main theorem can be used to calculate lower bounds for computations of functions if the operations <,+,−,*,/ are allowed and only the relational operators are counted. Friedman's sorting result and several other lower bounds are covered by the theorem. One of the results is of special interest for future directions of research, since it is possible to compute the max function of n arguments in a restricted domain with O(log n) relational operations.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Hopcroft, I.E., Ullman, I.D.: The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974

    Google Scholar 

  2. Ash, R.: Information Theory. New York: John Wiley and Sons, 1967

    Google Scholar 

  3. Dobosiewicz, W.: Sorting by distributive partitioning. Information Processing Lett 7, 1–6 (1978)

    Google Scholar 

  4. Fredman, M.L., Weide, B.: On the complexity of computing the measure ∼[a i, b i]. Comm. ACM 21, 540–544 (1978)

    Google Scholar 

  5. Friedman, N.: Some results on the effect of arithmetics on comparison problems. Proc. 13th Symp. Switching and Automata Theory, IEEE, pp. 139–143, 1972

  6. Reingold, E.M.: On the-optimality of some set algorithms. J. ACM 19, 649–659 (1972)

    Google Scholar 

  7. Schmitt, A.: On the computational power of the floor function. Information Processing Lett. 14, 1–3 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schmitt, A. On the number of relational operators necessary to compute certain functions of real variables. Acta Informatica 19, 297–304 (1983). https://doi.org/10.1007/BF00265560

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00265560

Keywords

Navigation