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

DOI10.1186/1687-1812-2014-14MaRDI QIDQ2017395zbMATH OpenOpenAlexWikidataFDO

Authors M. A. Alghamdi, Nazeer Shahzad, O. Valero

Publication date 20 March 2015

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

Copyright license Creative Commons Attribution 2.0 Generic

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) Fixed-point and coincidence theorems (topological aspects) (54H25) Baire category, Baire spaces (54E52)

Recommendations

• The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science
• A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms
• Fixed point theorems in generalized metric spaces with applications to computer science
• A fixed point theorem in partial quasi-metric spaces and an application to software engineering
• On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms

Cites work

• scientific article; zbMATH DE number 193197 (Why is no real title available?)
• scientific article; zbMATH DE number 1784847 (Why is no real title available?)
• An extensional treatment of lazy data flow deadlock
• Bicompleting weightable quasi-metric spaces and partial metric spaces
• Denotational semantics for programming languages, balanced quasi-metrics and fixed points
• Difference Equations
• Fixed point theorems in generalized metric spaces with applications to computer science
• Fixed point theorems on quasi-partial metric spaces
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
• Partial Metric Topology
• Partial quasi-metrics
• Quasi-metric properties of complexity spaces
• The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science
• The Smyth Completion

Cited in

(11)

• On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
• On quasi-metric aggregation functions and fixed point theorems
• The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science
• A new model based on a fuzzy quasi-metric type Baire applied to analysis of complexity
• Fixed points and completeness in metric and generalized metric spaces
• A Nemytskii-Edelstein type fixed point theorem for partial metric spaces
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
• Complexity analysis via approach spaces
• A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms
• A fixed point theorem in partial quasi-metric spaces and an application to software engineering
• The complexity probabilistic quasi-metric space

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017395)