Geodesic
FPT-algorithms and their classification on the basis of elasticity
Prikladnaâ diskretnaâ matematika, no. 2 (2011), pp. 40-48

Voir la notice de l'article provenant de la source Math-Net.Ru

We give a brief overview of the results and problems of parameterized algorithmics as the new direction of computational complexity theory. For a parameterized algorithm, we offer a new indicator of computational complexity which can be used to measure the growth rate of its complexity function depending on many variables. This indicator is a partial elasticity of the complexity function. We offer a two-dimensional classification of parameterized algorithms with the complexity function having a multiplicative form of presentation.
Keywords: computation complexity, parameterized algorithms, elasticity of algorithms. 
@article{PDM_2011_2_a2,
     author = {V. V. Bykova},
     title = {FPT-algorithms and their classification on the basis of elasticity},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {40--48},
     publisher = {mathdoc},
     number = {2},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2011_2_a2/}
}
TY  - JOUR
AU  - V. V. Bykova
TI  - FPT-algorithms and their classification on the basis of elasticity
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2011
SP  - 40
EP  - 48
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2011_2_a2/
LA  - ru
ID  - PDM_2011_2_a2
ER  - 
%0 Journal Article
%A V. V. Bykova
%T FPT-algorithms and their classification on the basis of elasticity
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 40-48
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2011_2_a2/
%G ru
%F PDM_2011_2_a2
V. V. Bykova. FPT-algorithms and their classification on the basis of elasticity. Prikladnaâ diskretnaâ matematika, no. 2 (2011), pp. 40-48. http://geodesic.mathdoc.fr/item/PDM_2011_2_a2/