2026-05-22T00:06:09Zhttps://repisalud.isciii.es/rest/oai/request

oai:repisalud.isciii.es:20.500.12105/201502024-11-29T05:59:03Zcom_20.500.12105_15322com_20.500.12105_2051col_20.500.12105_16967

00925njm 22002777a 4500 dc Shahzad, Naseer author Valero, Oscar author Alghamdi, Mohammed A author Alghamdi, Maryam A author 2015-10-06 In this paper we present a few fixed point results in the framework of topological posets. To this end, we introduce an appropriate notion of completeness and order-continuity. Special attention is paid to the case that the topology of the topological poset is induced by an extended quasi-metric. Finally, the applicability of the exposed results is illustrated providing a methodology to determine the asymptotic upper bound of the complexity of those algorithms whose running time of computing is the solution to a special type of recurrence equation. Shahzad N, Valero O, Alghamdi MA, Alghamdi Maryam A. On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms. Fixed Point Theory Appl. 2015 Oct 06;:179. 10.1186/s13663-015-0419-x 1687-1812 Fixed Point Theory and Applications http://hdl.handle.net/20.500.13003/10666 2-s2.0-84943652398 http://hdl.handle.net/20.500.12105/20150 366020200001 Topological poset Extended quasi-metric Hausdorff monotone Fixed point Asymptotic complexity analysis On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms