@inproceedings{d0f2ec2724964957983e132b57634120,
title = "Contraction maps on complexity spaces and itexpoDC algorithms",
abstract = "We present a mathematical model, based on techniques of Denotational Semantics, for the complexity analysis of itexpoDC algorithms. This is done by showing that the recurrence inequation associated to an itexpoDC algorithm gives rise to a contraction map on a suitable quasi-metric space of complexity functions. We prove that this contraction has a unique fixed point which is the maximal element, with respect the order induced by the quasi-metric, of the set of solutions of the recurrence inequation. The complexity of such an algorithm is represented by this maximal element.",
keywords = "Complexity quasi-metric space, Contraction mapping, Fixed point, ItexpoDC algorithm, Recurrence inequation",
author = "S. Romaguera and Schellekens, \{M. P.\} and P. Tirado and O. Valero",
year = "2007",
doi = "10.1063/1.2836000",
language = "English",
isbn = "9780735404786",
series = "AIP Conference Proceedings",
number = "2",
pages = "1343--1346",
booktitle = "Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007)",
edition = "2",
note = "International Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007 ; Conference date: 25-09-2007 Through 30-09-2007",
}