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

DOI10.1007/S13398-019-00691-8MaRDI QIDQ2331702zbMATH OpenOpenAlexFDO

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)

Recommendations

• On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms
• On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
• A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms
• Fixed point theorems in generalized metric spaces with applications to computer science
• New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs

Cites work

• scientific article; zbMATH DE number 5530321 (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 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 1142322 (Why is no real title available?)
• scientific article; zbMATH DE number 1784847 (Why is no real title available?)
• scientific article; zbMATH DE number 194916 (Why is no real title available?)
• A fixed point theorem for non-monotonic functions
• Applications of the complexity space to the general probabilistic divide and conquer algorithms
• Cauchy sequences in quasi-pseudo-metric spaces
• Common fixed points and coincidences of mapping families on partially ordered sets
• Difference Equations
• Fixed points and coincidences of mappings of partially ordered sets
• Functional analysis in asymmetric normed spaces
• 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
• On the Yoneda completion of a quasi-metric space
• Partial Metric Topology
• Qualitative versus quantitative fixed point techniques in computer science
• The Smyth Completion
• The contraction principle as a particular case of Kleene's fixed point theorem

Cited in

(5)

• 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 (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms
• scientific article; zbMATH DE number 18444 (Why is no real title available?)
• Kleene fixed point theorems and applications
• scientific article; zbMATH DE number 1827438 (Why is no real title available?)

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)