New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs
DOI10.1186/1687-1812-2014-14zbMATH Open1392.68450OpenAlexW2058173627WikidataQ59319218 ScholiaQ59319218MaRDI QIDQ2017395FDOQ2017395
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)
Full work available at URL: https://doi.org/10.1186/1687-1812-2014-14
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
fixed pointpartial metricrecurrence equationrunning time of computingasymptotic complexity analysisquasi-metricBaire partial quasi-metric
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Fixed-point and coincidence theorems (topological aspects) (54H25) Baire category, Baire spaces (54E52)
Cites Work
- Title not available (Why is that?)
- Fixed point theorems on quasi-partial metric spaces
- Partial Metric Topology
- Fixed point theorems in generalized metric spaces with applications to computer science
- Bicompleting weightable quasi-metric spaces and partial metric spaces
- Difference Equations
- The Smyth Completion
- Title not available (Why is that?)
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
- 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
- Denotational semantics for programming languages, balanced quasi-metrics and fixed points
- An extensional treatment of lazy data flow deadlock
Cited In (11)
- 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
- The complexity probabilistic quasi-metric space
- A fixed point theorem in partial quasi-metric spaces and an application to software engineering
- The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science
- Complexity analysis via approach spaces
- A Nemytskii-Edelstein type fixed point theorem for partial metric spaces
- 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
- On quasi-metric aggregation functions and fixed point theorems
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
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)