Save

Asymptotic Complexity of Algorithms via the Nonsymmetric Hausdorff Distance

In: Computing Letters
Authors:
Jesús Rodríguez-López E.T.S. Ingenieros de Caminos, Canales y Puertos Departamento de Matemática Aplicada Instituto de Matemática Pura y Aplicada Universidad Politécnica de Valencia 46022 Valencia Spain jrlopez@mat.upv.es; sromague@mat.upv.es

Search for other papers by Jesús Rodríguez-López in
Current site
Google Scholar
PubMed Close
,
Salvador Romaguera E.T.S. Ingenieros de Caminos, Canales y Puertos Departamento de Matemática Aplicada Instituto de Matemática Pura y Aplicada Universidad Politécnica de Valencia 46022 Valencia Spain jrlopez@mat.upv.es; sromague@mat.upv.es

Search for other papers by Salvador Romaguera in
Current site
Google Scholar
PubMed Close
, and
Oscar Valero Departamento de Matemáticas e Informática Universidad de las Islas Baleares 07122 Palma de Mallorca Baleares Spain o.valero@uib.es

Search for other papers by Oscar Valero in
Current site
Google Scholar
PubMed Close
Online Publication Date:
06 Mar 2004
Download Citation Get Permissions

Access options

Get access to the full article by using one of the access options below.

Institutional Login

Log in with Open Athens, Shibboleth, or your institutional credentials

Login via Institution

Purchase

Buy instant access (PDF download and unlimited online access):

Other access options

Rent on DeepDyve
Redeem Access Token

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.

Title:
Asymptotic Complexity of Algorithms via the Nonsymmetric Hausdorff Distance
Article Type:
Research Article
DOI:
https://doi.org/10.1163/157404006778330816
Language:
English
Pages:
155–161
Keywords:
asymptotic complexity; algorithms; Hausdorff quasi-metric
In:
Computing Letters
In:
Volume 2: Issue 3
Received:
29 Jun 2005
Accepted:
24 Apr 2006
Publisher:
VSP
E-ISSN:
1574-0404
Subjects:
Mathematics & Computer Sciences, Biology

Content Metrics

All Time Past 365 days Past 30 Days
Abstract Views 212 41 4
Full Text Views 5 0 0
PDF Views & Downloads 6 0 0