Topology and category theory in computer science
Topology and category theory in computer science
Semi-Lipschitz functions and best approximation in quasi-metric spaces
Journal of Approximation Theory
On the Yoneda completion of a quasi-metric space
Theoretical Computer Science
Quasi Uniformities: Reconciling Domains with Metric Spaces
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
On the structure of the space of complexity partial functions
International Journal of Computer Mathematics - Recent Advances in Computational and Applied Mathematics in Science and Engineering
A quantitative computational model for complete partial metric spaces via formal balls†
Mathematical Structures in Computer Science
Aggregation of asymmetric distances in Computer Science
Information Sciences: an International Journal
The average running time of an algorithm as a midpoint between fuzzy sets
Mathematical and Computer Modelling: An International Journal
On aggregation of normed structures
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.98 |
In 1995, Schellekens introduced the complexity (quasi-metric) space as a part of the development of a topological foundation for the complexity analysis of algorithms. Recently, Romaguera and Schellekens have obtained several quasi-metric properties of the complexity space which are interesting from a computational point of view, via the analysis of the so-called dual complexity space. Here, we extend the notion of the dual complexity space to the p-dual case, with p 1, in order to include some other kinds of exponential time algorithms in this study. We show that the dual p-complexity space is isometrically isomorphic to the positive cone of l"p endowed with the asymmetric norm |.|"+"p given on l"p by |x|"+"p = [@?"n"="0^~((x"n V0)^p)]^1^/^p, where x @? (x"n)"n"@e"@w. We also obtain some results on completeness and compactness of these spaces.