Skip to main content
Log in

Constructing sets of functions which have a givenF-cardinality

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

The termF-cardinality of ℱ (=F-card(ℱ)) is introduced whereF: ℝn → ℝn is a partial function and ℱ is a set of partial functionsf: ℝn → ℝn. TheF-cardinality yields a lower bound for the worst-case complexity of computingF if only functionsf ε ℱ can be evaluated by the underlying abstract automaton without conditional jumps. This complexity bound isindependent from the oracles available for the abstract machine. Thus it is shown that any automaton which can only apply the four basic arithmetic operations needs Ω(n logn) worst-case time to sortn numbers; this result is even true if conditional jumps witharbitrary conditions are possible. The main result of this paper is the following: Given a total functionF: ℝn → ℝn and a natural numberk, it is almost always possible to construct a set ℱ such that itsF-cardinality has the valuek; in addition, ℱ can be required to be closed under composition of functionsf,g ε ℱ. Moreover, ifF is continuous, then ℱ consists of continuous functions.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. Ben Or, Lower bounds for algebraic computation trees.Proc. ACM Symp. on Theory of Computing, Boston, MA (1983), pp. 80–86.

  2. N. Friedman, Some results on the effect of arithmetics on comparison problems.Proc. 13th Symp. on Switching and Automata Theory, New York (1972), pp. 139–143.

  3. U. Huckenbeck, Geometrische Maschinenmodelle. Ph.D. thesis, University of Würzburg (1986).

  4. U. Huckenbeck, On the complexity of the convex hull problem if rotational minima can be found very fast.Z. Oper. Res.,32 (3/4) (1988), 187–199.

    Google Scholar 

  5. K. Kuratowsky,Topology, Vol. 1. Academic Press, New York (1966).

    Google Scholar 

  6. F. P. Preparata, M. I. Shamos,Computational Geometry, An Introduction. Springer-Verlag, New York (1985).

    Google Scholar 

  7. A. Schmitt, On the number of relational operators necessary to compute certain functions of real variables.Acta Inform.,19 (1983), 297–304.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huckenbeck, U. Constructing sets of functions which have a givenF-cardinality. Math. Systems Theory 25, 3–22 (1992). https://doi.org/10.1007/BF01368781

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Navigation