Quasi-metric properties of complexity sp
β
S. Romaguera; M. Schellekens
π
Article
π
1999
π
Elsevier Science
π
English
β 110 KB
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 and Conquer algorithms have been discussed by . Here we obtain several quasi-