 |
|
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers) Mathematical Foundations of Informatics and Programming FPT-algorithms and their classification on the basis of elasticity V. V. Bykova Institute of Mathematics, Siberian Federal University, Krasnoyarsk, Russia Abstract: 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.  Full text:
PDF file (574 kB)
References:
PDF file
HTML file
Document Type: Article UDC: 510.52+004.051 Citation: V. V. Bykova, “FPT-algorithms and their classification on the basis of elasticity”, Prikl. Diskr. Mat., 2011, no. 2(12), 
Citation in format AMSBIB
\Bibitem{Byk11}Linking options:
Citing articles on Google Scholar: Russian citations, English citations Related articles on Google Scholar: Russian articles, English articles This publication is cited in the following articles:
|
|
||||||||||||||||||||||||||||||||||||||||||||
|
|
Contact us: |
 Terms of Use
|
Registration |
Logotypes |
|