A connection between computer science and fuzzy theory: midpoints and running time of computing

作者: O. Valero , J. Casasnovas

DOI:

关键词:

摘要: Following the mathematical formalism introduced by M. Schellekens [Electronic Notes in Theoret. Comput. Sci. 1 (1995), 211-232] order to give a common foundation for Denotational Semantics and Complexity Analysis, we obtain an application of theory midpoints asymmetric distances dened between fuzzy sets complexity analysis algorithms programs. In particular show that average running time algorithm known as Largetwo is exactly midpoint best worst case computing.

参考文章(19)
Fletcher, Quasi-uniform spaces ,(1982)
M. Schellekens, The Smyth Completion Electronic Notes in Theoretical Computer Science. ,vol. 1, pp. 535- 556 ,(1995) , 10.1016/S1571-0661(04)00029-5
Aleksandar Stojmirovic, Quasi-metric spaces with measure arXiv: General Topology. ,(2003)
Anthony Karel Seda, Quasi-Metrics And The Semantics Of Logic Programs Fundamenta Informaticae. ,vol. 29, pp. 97- 117 ,(1997) , 10.3233/FI-1997-291205
Jesús Rodríguez-López, Salvador Romaguera, Oscar Valero, Asymptotic Complexity of Algorithms via the Nonsymmetric Hausdorff Distance Computing Letters. ,vol. 2, pp. 155- 161 ,(2006) , 10.1163/157404006778330816
L.M. García-Raffi, S. Romaguera, E.A. Sánchez-Pérez, Sequence spaces and asymmetric norms in the theory of computational complexity Mathematical and Computer Modelling. ,vol. 36, pp. 1- 11 ,(2002) , 10.1016/S0895-7177(02)00100-0
Giangiacomo Gerla, Fuzzy submonoids, fuzzy preorders and quasi-metrics Fuzzy Sets and Systems. ,vol. 157, pp. 2356- 2370 ,(2006) , 10.1016/J.FSS.2006.05.007