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/}
}
TY  - JOUR
AU  - V. V. Bykova
TI  - Elasticity of algorithms
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 87
EP  - 95
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_2_a8/
LA  - ru
ID  - PDM_2010_2_a8
ER  - 
%0 Journal Article
%A V. V. Bykova
%T Elasticity of algorithms
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 87-95
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2010_2_a8/
%G ru
%F 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/