Abstract
In this paper we continue the study of fixed point theory in partial quasi-metric spaces and its usefulness in complexity analysis of algorithms. Concretely we prove two new fixed point results for monotone and continuous self-mappings in 0-complete partial quasi-metric spaces and, in addition, we show that the assumptions in the statement of such results cannot be weakened. Furthermore, as an application, we present a quantitative fixed point technique which is helpful for asymptotic complexity analysis of algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
