- Full text PDF available (24)
- This year (1)
- Last five years (11)
The complexity (quasi-metric) space has been introduced as a part of the development of a topological foundation for the complexity analysis of algorithms (). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in . Here we obtain several quasi-metric properties of the complexity space. The main… (More)
In this paper we prove common fixed point theorems for a class of fuzzy mappings in Smyth-complete quasi-metric spaces. Well-known theorems are special case of our results.
In  M. Schellekens introduced the complexity (quasi-metric) space as a part of the research in Theoretical Computer Science and Topology, with applications to the complexity analysis of algorithms. Later on, S. Romaguera and M. Schellekens () introduced the so-called dual complexity (quasi-metric) space and established several quasi-metric… (More)