Computing complexity distances between algorithms

Kybernetika

Volumn 39, Issue 5, 2003, Pages 569-582

  Romaguera, Salvador ^a   Sánchez Pérez, Enrique A ^a   Valero, Oscar ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Baire metric; Balanced quasi metric; Complexity function; Contraction mapping; Divide Conquer algorithm; Infinite word; Invariant extended quasi metric

Indexed keywords

ALGORITHMS; FUNCTIONS; MATHEMATICAL MODELS; TOPOLOGY;

BAIRSE METRIC; BALANCED-QUASI-METRIC; COMPLEXITY FUNCTION; CONTRACTION MAPPING; INFINITE WORD; INVARIANT EXTENDED QUASI-METRIC;

COMPUTATIONAL COMPLEXITY;

EID: 1642346810     PISSN: 00235954     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (23)

1. J. W. de Bakker and E. P. de Vink: Denotational models for programming languages: applications of Banach's fixed point theorem. Topology Appl. 85 (1998), 35-52.
2. L. Ćirić: Periodic and fixed point theorems in a quasi-metric space. J. Austral. Math. Soc. Ser. A 54 (1993), 80-85.
3. D. Doitchinov: On completeness in quasi-metric spaces. Topology Appl. 30 (1988), 127-148.
4. R. Engelking: General Topology. Polish Sci. Publ., Warsaw 1977.
5. R. C. Flagg and R. D. Kopperman: Fixed points and reflexive domain equations in categories of continuity spaces. Electronic Notes Theoret. Comput. Sci. vol. 1 (1995), URL: http://www.elsevier.nl/locate/entcs/volume1.html
6. P. Fletcher and W.F. Lindgren: Quasi-Uniform Spaces. Marcel Dekker, 1982.
7. L. M. García-Raffi, S. Romaguera, and E. A. Sánchez-Pérez: Sequence spaces and asymmetric norms in the theory of computational complexity. Math. Comput. Modelling 36 (2002), 1-11.
8. J. R. Giles: Introduction to the Analysis of Metric Spaces. (Austral. Math. Soc. Lecture Series no. 3.) Cambridge Univ. Press, Cambridge 1987.
9. T. L. Hicks: Fixed point theorems for quasi-metric spaces. Math. Japon. 33 (1988), 231-236.
10. J. Jachymski: A contribution to fixed point theory in quasi-metric spaces. Publ. Math. Debrecen 43 (1993), 283-288.
11. G. Kahn: The semantics of a simple language for parallel processing. In: Proc. IFIP Congress, Elsevier and North-Holland, Amsterdam 1974, pp. 471-475.
12. K. Keimel and W. Roth: Ordered Cones and Approximation. Springer-Verlag, Berlin 1992.
13. R. D. Kopperman: Lengths on semigroups and groups. Semigroup Forum 25 (1982), 345-360.
14. H. P. A. Künzi: Nonsymmetric distances and their associated topologies: About the origin of basic ideas in the area of asymmetric topology. In: Handbook of the History of General Topology, Volume 3 (C.E. Aull and R. Lowen eds.), Kluwer, Dordrecht 2001, pp. 853-968.
15. H. P. A. Künzi and C. Ryser: The Bourbaki quasi-uniformity. Topology Proc. 20 (1995), 161-183.
16. P. Lecȯmte and M. Rigo: On the representation of real numbers using regular languages. Theory Comput. Systems 35 (2002), 13-38.
17. S. G. Matthews: Partial metric topology. In: Proc. 8th Summer Conference on General Topology and Applications, Ann. New York Acad. Sci. 728 (1994), 183-197.
18. I. L. Reilly and P. V. Subrahmanyam: Some fixed point theorems. J. Austral. Math. Soc. Ser. A 53 (1992), 304-312.
19. I. L. Reilly, P. V. Subrahmanyam, and M.K. Vamanamurthy: Cauchy sequences in quasi-pseudo-metric spaces. Monatsh. Math. 99 (1982), 127-140.
20. S. Romaguera and M. Sanchis: Semi-Lipschitz functions and best approximation in quasi-metric spaces. J. Approx. Theory 103 (2000), 292-301.
21. S. Romaguera and M. Schellekens: Quasi-metric properties of complexity spaces. Topology Appl. 98 (1999), 311-322.
22. S. Romaguera and M. Schellekens: Duality and quasi-normability for complexity spaces. Appl. Gen. Topology 3 (2002), 91-112.
23. M. Schellekens: The Smyth completion: a common foundation for denotational semantics and complexity analysis. In: Proc. MFPS 11, Electronic Notes Theoret. Comput. Sci. vol. 1 (1995), URL: http://www.elsevier.nl/locate/entcs/volumel.html