On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
DOI10.1007/s13398-019-00691-8OpenAlexW2946020682MaRDI QIDQ2331702
Juan-José Miñana, Oscar Valero, Asier Estevan
Publication date: 30 October 2019
Published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/2454/36069
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Complete metric spaces (54E50) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05) Fixed-point theorems (47H10) Fixed-point and coincidence theorems (topological aspects) (54H25) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Fixed points and coincidences of mappings of partially ordered sets
- Applications of the complexity space to the general probabilistic divide and conquer algorithms
- Cauchy sequences in quasi-pseudo-metric spaces
- The contraction principle as a particular case of Kleene's fixed point theorem
- On the Yoneda completion of a quasi-metric space
- A fixed point theorem for non-monotonic functions
- Common fixed points and coincidences of mapping families on partially ordered sets
- Functional Analysis in Asymmetric Normed Spaces
- Mathematical Aspects of Logic Programming Semantics
- Difference Equations
- The Smyth Completion
- Partial Metric Topology
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
