Geodesic
Recognition Method of Algorithms Classes on the Basis of Asymptotics for the Elasticity of Complexity Functions
Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 2 (2009) no. 1, pp. 48-62.

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

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.
Keywords: computation complexity, elasticity of algorithms. 
@article{JSFU_2009_2_1_a4,
     author = {Valentina V. Bykova},
     title = {Recognition {Method} of {Algorithms} {Classes} on the {Basis} of {Asymptotics} for the {Elasticity} of {Complexity} {Functions}},
     journal = {\v{Z}urnal Sibirskogo federalʹnogo universiteta. Matematika i fizika},
     pages = {48--62},
     publisher = {mathdoc},
     volume = {2},
     number = {1},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a4/}
}
TY  - JOUR
AU  - Valentina V. Bykova
TI  - Recognition Method of Algorithms Classes on the Basis of Asymptotics for the Elasticity of Complexity Functions
JO  - Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
PY  - 2009
SP  - 48
EP  - 62
VL  - 2
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a4/
LA  - ru
ID  - JSFU_2009_2_1_a4
ER  - 
%0 Journal Article
%A Valentina V. Bykova
%T Recognition Method of Algorithms Classes on the Basis of Asymptotics for the Elasticity of Complexity Functions
%J Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
%D 2009
%P 48-62
%V 2
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a4/
%G ru
%F JSFU_2009_2_1_a4
Valentina V. Bykova. Recognition Method of Algorithms Classes on the Basis of Asymptotics for the Elasticity of Complexity Functions. Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 2 (2009) no. 1, pp. 48-62. http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a4/

[1] V. V. Bykova, T. P. Portnyagina, “Issledovanie uglovoi mery asimptoticheskogo rosta funktsii slozhnosti algoritmov”, Trudy Sedmoi Vserossiiskoi FAM' 2008 konferentsii, Ch. 2, SFU, Krasnoyarsk, 2008, 47–57

[2] O. N. Vasilenko, Teoretiko-chislovye algoritmy v kriptografii, MTsNMO, M., 2006

[3] V. A. Goloveshkin, M. V. Ulyanov, “Metod klassifikatsii vychislitelnykh algoritmov po slozhnosti na osnove uglovoi mery asimptoticheskogo rosta funktsii”, Vychislitelnye tekhnologii, 11:1 (2006), 52–62

[4] R. Grekhem, D. Knut, O. Potashnik, Konkretnaya matematika, Mir, Binom, Laboratoriya znanii, M., 2006

[5] M. Geri, D. Dzhonson, Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR

[6] K. Dougerti, Vvedenie v ekonometriku, INFRA-M, M., 2001

[7] T. Kormen, Ch. Leizerson, R. Rivest, Algoritmy: postroenie i analiz, MTsNMO, M., 1999

[8] A. S. Solodovnikov, V. A. Babaitsev, A. V. Brailov, I. G. Shandra, Matematika v ekonomike, Finansy i statistika, M., 2001

[9] V. A. Uspenskii, A. L. Semenov, Teoriya algoritmov: osnovnye otkrytiya i prilozheniya, Nauka, M., 1987 | MR | Zbl

[10] G. Kh. Khardi, Kurs chistoi matematiki, IL, M., 1949

[11] A. L. Chmora, Sovremennaya prikladnaya kriptografiya, Gelios ARV, M., 2001

[12] I. P. Natanson, Kratkii kurs vysshei matematiki, Lan, SPb., 1997