A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms

DOI10.1016/j.topol.2015.12.074zbMath1334.54068OpenAlexW2233264084MaRDI QIDQ266307

Oscar Valero, Zahra Mohammadi

Publication date: 13 April 2016

Published in: Topology and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.topol.2015.12.074

zbMATH Keywords

fixed point0-completenesspartial quasi-metricrecurrence equationrunning time of computing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complete metric spaces (54E50) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05) Fixed-point and coincidence theorems (topological aspects) (54H25)

Related Items (5)

On the bicompletion of a partial quasi-metric space and \(T_0\)-quasi-metric spaces ⋮ Existence of coincidence and common fixed points for a sequence of mappings in quasi partial metric spaces ⋮ New fixed point results in partial quasi-metric spaces ⋮ Some \(\varphi\)-coupled fixed point results via modified \(F\)-control function's concept in metric spaces and its applications ⋮ General versions of the Ekeland variational principle: Ekeland points and stop and go dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science
• Partial quasi-metrics
• A Kirk type characterization of completeness for partial metric spaces
• The contraction principle as a particular case of Kleene's fixed point theorem
• New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs
• On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics
• Bicompleting weightable quasi-metric spaces and partial metric spaces
• The complexity space of partial functions: a connection between complexity analysis and denotational semantics
• Difference Equations
• The Smyth Completion
• Partial Metric Topology
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces

This page was built for publication: A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms