Add to ORKGWe introduce and study a probabilistic quasi-metric on the set of complexity functions, which provides an efficient framework to measure the distance from a complexity function "f" to another one "g" in the case that "f" is asymptotically more eficient than "g". In this context we also obtanin a version of the Banach fixed point theorem.Tirado Peláez, P. (2011). The complexity probabilistic quasi-metric space. http://hdl.handle.net/10251/12823Archivo delegad
AbstractIn this paper, we consider the behavioral pseudometrics for probabilistic systems, which are...
Probabilistic metric spaces are characterized as those spaces in which a suitable family of continuo...
In this paper we prove minimization theorem in the generating space of quasi probabilistic metric sp...
We introduce and study a probabilistic quasi-metric on the set of complexity functions, which provid...
AbstractWe introduce and study a probabilistic quasi-metric on the set of complexity functions, whic...
[EN] We introduce and study a probabilistic quasi-metric on the set of complexity functions, which p...
[EN] We introduce and study a probabilistic quasi-metric on the set of complexity functions, which p...
[EN] We introduce and study a probabilistic quasi-metric on the set of complexity functions, which p...
AbstractWe introduce and study a probabilistic quasi-metric on the set of complexity functions, whic...
summary:We introduce a new (extended) quasi-metric on the so-called dual p-complexity space, which i...
AbstractThe complexity (quasi-metric) space has been introduced as a part of the development of a to...
In this paper, we consider the behavioral pseudometrics for probabilistic systems, which are a quant...
Schellekens [The Smyth completion: A common foundation for denotational semantics and complexity ana...
summary:We introduce a new (extended) quasi-metric on the so-called dual p-complexity space, which i...
summary:We introduce a new (extended) quasi-metric on the so-called dual p-complexity space, which i...
AbstractIn this paper, we consider the behavioral pseudometrics for probabilistic systems, which are...
Probabilistic metric spaces are characterized as those spaces in which a suitable family of continuo...
In this paper we prove minimization theorem in the generating space of quasi probabilistic metric sp...
We introduce and study a probabilistic quasi-metric on the set of complexity functions, which provid...
AbstractWe introduce and study a probabilistic quasi-metric on the set of complexity functions, whic...
[EN] We introduce and study a probabilistic quasi-metric on the set of complexity functions, which p...
[EN] We introduce and study a probabilistic quasi-metric on the set of complexity functions, which p...
[EN] We introduce and study a probabilistic quasi-metric on the set of complexity functions, which p...
AbstractWe introduce and study a probabilistic quasi-metric on the set of complexity functions, whic...
summary:We introduce a new (extended) quasi-metric on the so-called dual p-complexity space, which i...
AbstractThe complexity (quasi-metric) space has been introduced as a part of the development of a to...
In this paper, we consider the behavioral pseudometrics for probabilistic systems, which are a quant...
Schellekens [The Smyth completion: A common foundation for denotational semantics and complexity ana...
summary:We introduce a new (extended) quasi-metric on the so-called dual p-complexity space, which i...
summary:We introduce a new (extended) quasi-metric on the so-called dual p-complexity space, which i...
AbstractIn this paper, we consider the behavioral pseudometrics for probabilistic systems, which are...
Probabilistic metric spaces are characterized as those spaces in which a suitable family of continuo...
In this paper we prove minimization theorem in the generating space of quasi probabilistic metric sp...