Author： Rodríguez-López Jesús Romaguera Salvador Valero Oscar
Publisher： VSP
ISSN： 1574-0404
Source： Computing Letters, Vol.2, Iss.3, 2006-09, pp. : 155-161
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
The theory of nonsymmetric topology has been successfully applied to the theory of complexity of algorithms. In 1995, Schellekens introduced a quasi-pseudo-metric space in order to obtain a mathematical model for the study of complexity of algorithms. Here, we provide a mathematical context to study the asymptotic complexity of algorithms.
Related content
Hyperbolic Hausdorff Distance for Medial Axis Transform
Graphical Models, Vol. 63, Iss. 5, 2001-09 ,pp. :
Access to resources
Recommend
On the asymptotic behaviour of primitive recursive algorithms
By David R.
Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. :
Complexity and algorithms for nonlinear optimization problems
Annals of Operations Research, Vol. 153, Iss. 1, 2007-09 ,pp. :
Asymptotic properties of some underdiagonal walks generation algorithms
By Louchard G.
Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. :