Mathematical Foundations of Informatics and Programming
FPT-algorithms and their classification on the base of elasticity
V. V. Bykova
Institute of Mathematics, Siberian Federal University, Krasnoyarsk
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.
PDF file (482 kB)
V. V. Bykova, “FPT-algorithms and their classification on the base of elasticity”, Prikl. Diskr. Mat., 2011, supplement № 4, 58–60
Citation in format AMSBIB
\paper FPT-algorithms and their classification on the base of elasticity
\jour Prikl. Diskr. Mat.
\issueinfo supplement № 4
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|