Elasticity of algorithms
Prikladnaâ diskretnaâ matematika, no. 2 (2010), pp. 87-95
Voir la notice de l'article provenant de la source Math-Net.Ru
We present the characterization of elasticity for rapid, polynomial, subexponential, exponential and hyperexponential algorithms. We give a method for comparing algorithms by their elasticity.
Keywords:
computation complexity, algorithms analysis.
@article{PDM_2010_2_a8,
author = {V. V. Bykova},
title = {Elasticity of algorithms},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {87--95},
publisher = {mathdoc},
number = {2},
year = {2010},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2010_2_a8/}
}
V. V. Bykova. Elasticity of algorithms. Prikladnaâ diskretnaâ matematika, no. 2 (2010), pp. 87-95. http://geodesic.mathdoc.fr/item/PDM_2010_2_a8/