On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms

DOI10.1007/S13398-019-00691-8OpenAlexW2946020682MaRDI QIDQ2331702FDOQ2331702

Authors: Asier Estevan, Juan-José Miñana, O. Valero 

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

zbMATH Keywords

fixed pointpartial orderrecurrence equationquasi-metricasymptotic complexityKleene

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Fixed-point theorems (47H10) Fixed-point and coincidence theorems (topological aspects) (54H25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Complete metric spaces (54E50) Linearly ordered topological spaces, generalized ordered spaces, and partially ordered spaces (54F05) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Partial Metric Topology
• Cauchy sequences in quasi-pseudo-metric spaces
• The contraction principle as a particular case of Kleene's fixed point theorem
• Functional Analysis in Asymmetric Normed Spaces
• Difference Equations
• The Smyth Completion
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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?)
• Title not available (Why is that?)
• Non-Hausdorff Topology and Domain Theory
• On the Yoneda completion of a quasi-metric space
• Mathematical aspects of logic programming semantics.
• Applications of the complexity space to the general probabilistic divide and conquer algorithms
• Title not available (Why is that?)
• A fixed point theorem for non-monotonic functions
• Fixed points and coincidences of mappings of partially ordered sets
• Common fixed points and coincidences of mapping families on partially ordered sets
• Qualitative versus quantitative fixed point techniques in computer science

Cited In (5)

• On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms
• A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms
• Title not available (Why is that?)
• Kleene fixed point theorems and applications
• Title not available (Why is that?)

This page was built for publication: On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331702)