Journal of Siberian Federal University. Mathematics & Physics / Recognition Method of Algorithms Classes on the Basis of Asymptotics for the Elasticity of Complexity Functions

Full text (.pdf)
Issue
Journal of Siberian Federal University. Mathematics & Physics. 2009 2 (1)
Authors
Bykova, Valentina V.
Contact information
Valentina V.Bykova: e-mail:
Keywords
computation complexity; elasticity of algorithms
Abstract

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, exponen- tial 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.

Pages
48-62
Paper at repository of SibFU
https://elib.sfu-kras.ru/handle/2311/884