On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms
From MaRDI portal
Publication:5152986
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
Cites work
- scientific article; zbMATH DE number 5530321 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- scientific article; zbMATH DE number 193197 (Why is no real title available?)
- scientific article; zbMATH DE number 3297510 (Why is no real title available?)
- A frame for general divide-and-conquer recurrences
- Cauchy sequences in quasi-pseudo-metric spaces
- Contractive mapping theorems in partially ordered sets and applications to ordinary differential equations
- Denotational semantics for programming languages, balanced quasi-metrics and fixed points
- Difference Equations
- Mathematical aspects of logic programming semantics.
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
- Non-Hausdorff topology and domain theory. Selected topics in point-set topology
- Qualitative versus quantitative fixed point techniques in computer science
- The Smyth Completion
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics
- The contraction principle as a particular case of Kleene's fixed point theorem
- Time bounds for selection
Cited in
(5)- On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
- Fixed point theorems in quasi-metric spaces and the specialization partial order
- New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs
- A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms
- Algorithms with mediant convergents and their metrical theory
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)