New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs

DOI10.1186/1687-1812-2014-14zbMath1392.68450OpenAlexW2058173627WikidataQ59319218 ScholiaQ59319218MaRDI QIDQ2017395

Oscar Valero, Naseer Shahzad, Maryam A. Alghamdi

Publication date: 20 March 2015

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1687-1812-2014-14

zbMATH Keywords

fixed pointpartial metricrecurrence equationrunning time of computingasymptotic complexity analysisquasi-metricBaire partial quasi-metric

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Baire category, Baire spaces (54E52) Fixed-point and coincidence theorems (topological aspects) (54H25)

Related Items

A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms ⋮ On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms ⋮ Fixed points and completeness in metric and generalized metric spaces ⋮ A fixed point theorem in partial quasi-metric spaces and an application to software engineering ⋮ A Nemytskii-Edelstein type fixed point theorem for partial metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• An extensional treatment of lazy data flow deadlock
• The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science
• Partial quasi-metrics
• Quasi-metric properties of complexity spaces
• Fixed point theorems in generalized metric spaces with applications to computer science
• Fixed point theorems on quasi-partial metric spaces
• Bicompleting weightable quasi-metric spaces and partial metric spaces
• Difference Equations
• The Smyth Completion
• Partial Metric Topology
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
• Denotational semantics for programming languages, balanced quasi-metrics and fixed points

This page was built for publication: New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs