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_13zbMath1476.54081OpenAlexW3208939274MaRDI QIDQ5152986
Oscar Valero, M. D. Mabula, Juan-José Miñana
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
fixed pointpartially ordered metric spacecomplexity analysis of algorithmspartially ordered quasi-metric spacespecialized partial order
Analysis of algorithms and problem complexity (68Q25) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05) Fixed-point and coincidence theorems (topological aspects) (54H25) Special maps on metric spaces (54E40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cauchy sequences in quasi-pseudo-metric spaces
- The contraction principle as a particular case of Kleene's fixed point theorem
- Time bounds for selection
- A frame for general divide-and-conquer recurrences
- 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
- Mathematical Aspects of Logic Programming Semantics
- Difference Equations
- The Smyth Completion
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
- Non-Hausdorff Topology and Domain Theory
- Qualitative versus quantitative fixed point techniques in computer science
- Denotational semantics for programming languages, balanced quasi-metrics and fixed points
This page was built for publication: On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms
