On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
Crossref DOI link: https://doi.org/10.1007/s13398-019-00691-8
Published Online: 2019-05-16
Published Print: 2019-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Estevan, Asier http://orcid.org/0000-0002-8822-2438
Miñana, Juan-José http://orcid.org/0000-0001-9835-0700
Valero, Oscar http://orcid.org/0000-0003-4710-1338
Text and Data Mining valid from 2019-05-16
Version of Record valid from 2019-05-16
Article History
Received: 28 June 2018
Accepted: 8 May 2019
First Online: 16 May 2019