Por favor, use este identificador para citar o enlazar este Item:http://hdl.handle.net/20.500.12105/20150
Título
On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
Autor(es)
Fecha de publicación
2015-10-06
Cita
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.
Idioma
Inglés
Tipo de documento
research article
Resumen
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.
Palabras clave
Topological poset | Extended quasi-metric | Hausdorff | monotone | Fixed point | Asymptotic complexity analysis
Versión en línea
DOI
Aparece en las colecciones
Acceso a texto completo