#### Filter Results:

#### Publication Year

1997

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

The complexity (quasi-metric) space has been introduced as a part of the development of a topological foundation for the complexity analysis of algorithms ([12]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in [12]. 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 [15] 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 ([13]) introduced the so-called dual complexity (quasi-metric) space and established several quasi-metric… (More)

- A. Garćıa-Máynez, S. Romaguera
- 2010

We show that a Tychonoff space is the perfect pre-image of a cofinally complete metric space if and only if it is paracompact and cofinallyČech complete. Further properties of these spaces are discussed. In particular, cofinalČech completeness is preserved both by perfect mappings and by continuous open mappings.