The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science
From MaRDI portal
Publication:692921
DOI10.1007/s00224-010-9310-7zbMath1255.68314arXiv1009.6105MaRDI QIDQ692921
M. A. Cerdà-Uguet, Michel Schellekens, Oscar Valero
Publication date: 6 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.6105
fixed point; partial metric; recurrence equation; running time of computing; asymptotic complexity analysis; quasi-metric; Baire partial metric; Baire partial quasi-metric
68W40: Analysis of algorithms
54H25: Fixed-point and coincidence theorems (topological aspects)
54H99: Connections of general topology with other structures, applications
Related Items
New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces, An induction theorem and Ekeland's variational principle in partial metric spaces with applications, 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 Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science, Some \(\varphi\)-coupled fixed point results via modified \(F\)-control function's concept in metric spaces and its applications, New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs, Fixed point theorems in generalized metric spaces with applications to computer science, On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics, Endpoints in \(T_0\)-quasi-metric spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extensional treatment of lazy data flow deadlock
- 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
- Bicompleting weightable quasi-metric spaces and partial metric spaces
- Difference Equations
- The Smyth Completion
- Partial Metric Topology