|
Article information
2006 , Volume 11, ¹ 1, p.52-62
Goloveshkin V.A., Ulyanov M.V.
Complexity classification method for algorithms based on angular measure of functions' asymptotic increase
A new classification of complexity of algorithms designed for solving the problems of theoretical and practical comparative analysis of computational algorithms is proposed. The classification is based on a special angular measure of the asymptotic growth rate of functions and enables to range the algorithms according to their growth rate of difficulty.
[full text] Author(s):
Goloveshkin V.A.
Dr. , Associate Professor
Position: Professor
Address: 630090, Russia, Moscow
E-mail: muljanov@mail.ru
Ulyanov Mikhail Vasilievich
Dr. , Professor
Position: Professor
Office: V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, Lomonosov Moscow State University
Address: 117997, Russia, Moscow, 65 Profsoyuznaya street
Phone Office: (495) 334-89-10
E-mail: muljanov@mail.ru
Bibliography link:
Goloveshkin V.A., Ulyanov M.V. Complexity classification method for algorithms based on angular measure of functions' asymptotic increase // Computational technologies. 2006. V. 11. ¹ 1. P. 52-62
|
|
|
|
