This article is cited in 5 scientific papers (total in 5 papers)
Recognition Method of Algorithms Classes on the Basis of Asymptotics for the Elasticity of Complexity Functions
Valentina V. Bykova
Institute of Mathematics, Siberian Federal University
We offer a new indication to recognize the algorithms classes which is based on the asymptotic behavior of the elasticity of complexity functions. The present day analogy for functions of complexity algorithms and produced functions is used, the rate of which is traditionally evaluated by elasticity in econometrics. The theorem that states the characterization of elasticity for rapid, polynomial, subexponential, exponential and hyperexponential algorithms has been proved. The principal advantage of the suggested indication is that it allows the simplicity of computation caused by the well-known properties of elasticity.
computation complexity, elasticity of algorithms.
PDF file (360 kB)
Valentina V. Bykova, “Recognition Method of Algorithms Classes on the Basis of Asymptotics for the Elasticity of Complexity Functions”, J. Sib. Fed. Univ. Math. Phys., 2:1 (2009), 48–62
Citation in format AMSBIB
\paper Recognition Method of Algorithms Classes on the Basis of Asymptotics for the Elasticity of Complexity Functions
\jour J. Sib. Fed. Univ. Math. Phys.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
V. V. Bykova, “Elastichnost algoritmov”, PDM, 2010, no. 2(8), 87–95
V. V. Bykova, “Elastichnost algoritmov”, PDM, 2010, prilozhenie № 3, 76–78
Valentina V. Bykova, “Analysis parameterized algorithms on the bases of elasticity to functions complexity”, Zhurn. SFU. Ser. Matem. i fiz., 4:2 (2011), 195–207
V. V. Bykova, “FPT-algoritmy i ikh klassifikatsiya na osnove elastichnosti”, PDM, 2011, no. 2(12), 40–48
V. V. Bykova, “FTP-algoritmy i ikh klassifikatsiya na osnove elastichnosti”, PDM, 2011, prilozhenie № 4, 58–60
|Number of views:|