The following pages link to The Smyth Completion (Q4222778):
Displaying 14 items.
- A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms (Q266307) (← links)
- On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms (Q288177) (← links)
- A characterization of Smyth complete quasi-metric spaces via Caristi's fixed point theorem (Q288181) (← links)
- Fixed point theory for cyclic generalized weak \(\phi\)-contraction on partial metric spaces (Q448710) (← links)
- Complexity spaces as quantitative domains of computation (Q536037) (← links)
- \(Q\)-functions on quasimetric spaces and fixed points for multivalued maps (Q536875) (← links)
- Hyperspaces of a weightable quasi-metric space: application to models in the theory of computation (Q614291) (← links)
- The complexity probabilistic quasi-metric space (Q624638) (← links)
- Applications and common coupled fixed point results in ordered partial metric spaces (Q680742) (← links)
- The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science (Q692921) (← links)
- Quasi-metrics and monotone normality (Q719741) (← links)
- The average running time of an algorithm as a midpoint between fuzzy sets (Q732662) (← links)
- On the triangle equality (Q4634665) (← links)
- (Q6070563) (← links)
