共 24 条
[1]
Hitzler P(2010)Generalized distance functions in the theory of computation Comput. J. 53 443-464
[2]
Seda AK(1995)The Smyth completion: a common foundation for the denotational semantics and complexity analysis Electron. Notes Theor. Comput. Sci. 1 211-232
[3]
Schellekens M(2003)Computing complexity distances between algorithms Kybernetika 39 569-582
[4]
Romaguera S(2014)New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs Fixed Point Theory Appl. 2014 203-213
[5]
Sánchez-Pérez EA(2013)Fixed point theorems in generalized metric spaces with applications to computer science Fixed Point Theory Appl. 2013 127-148
[6]
Valero O(2013)On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics Abstr. Appl. Anal. 2013 183-197
[7]
Alghamdi MA(2000)On the order-theoretic Cantor theorem Taiwan. J. Math. 4 151-162
[8]
Shahzad N(1988)On completeness in quasi-metric spaces Topol. Appl. 30 623-630
[9]
Valero O(1994)Partial metric topology Ann. N.Y. Acad. Sci. 728 undefined-undefined
[10]
Alghamdi MA(2002)Bicompleting weightable quasi-metric spaces and partial metric spaces Rend. Circ. Mat. Palermo 51 undefined-undefined