On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms
DOI10.1007/978-3-030-70974-7_13zbMATH Open1476.54081OpenAlexW3208939274MaRDI QIDQ5152986FDOQ5152986
Authors: M. D. Mabula, Juan-José Miñana, O. Valero 
Publication date: 28 September 2021
Published in: Trends in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-70974-7_13
Recommendations
- 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 partially ordered sets and an application to asymptotic complexity of algorithms
- On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
- Fixed point theorems in partially ordered metric spaces and applications
- Fixed point theorems in generalized metric spaces with applications to computer science
- Fixed point theorems in quasi-metric spaces and the specialization partial order
- Fixed point theorems in partially ordered complete metric spaces
- On fixed points in quasi partial \(b\)-metric spaces and an application to dynamic programming
- Some fixed point theorems in ordered partial metric spaces with applications
- Some fixed point results in ordered partial metric spaces
fixed pointpartially ordered metric spacecomplexity analysis of algorithmspartially ordered quasi-metric spacespecialized partial order
Analysis of algorithms and problem complexity (68Q25) Special maps on metric spaces (54E40) Fixed-point and coincidence theorems (topological aspects) (54H25) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cauchy sequences in quasi-pseudo-metric spaces
- The contraction principle as a particular case of Kleene's fixed point theorem
- Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics
- Difference Equations
- The Smyth Completion
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-Hausdorff Topology and Domain Theory
- Mathematical aspects of logic programming semantics.
- Denotational semantics for programming languages, balanced quasi-metrics and fixed points
- Title not available (Why is that?)
- Time bounds for selection
- A frame for general divide-and-conquer recurrences
- Qualitative versus quantitative fixed point techniques in computer science
Cited In (2)
This page was built for publication: On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5152986)
