One small step for a man
One Giant leap for the mankind

There is no wealth like Knowledge
                            No Poverty like Ignorance
Journal of Emerging Trends in Computing and Information Sciences Logo

Journal of Emerging Trends in Computing and Information Sciences >> Call for Papers Vol. 8 No. 3, March 2017

Journal of Emerging Trends in Computing and Information Sciences

A Measure of Functions’ Asymptotic Growth and the Complexity Classification of Computer Algorithms

Full Text Pdf Pdf
Author Goloveshkin, V.A., Uljanov, M.V.
ISSN 2079-8407
On Pages 1498-1505
Volume No. 3
Issue No. 11
Issue Date December 01, 2012
Publishing Date December 01, 2012
Keywords Algorithms, algorithm complexity, functions' asymptotic growth measure, complexity classification of the algorithms


Abstract

In this paper, a special angular measure of functions’ asymptotic growth is offered, which allows one to distinguish between sub-polynomial, polynomial, sub-exponential, exponential and super-exponential functions. On the basis of the measure, an algorithm computational complexity classification is introduced oriented to application in theoretical and practical comparative analysis of computer algorithms. 

Back

Seperator
    Journal of Computing | Call for Papers (CFP) | Journal Blog | Journal of Systems and Software | ARPN Journal of Science and Technology | International Journal of Health and Medical Sciences | International Journal of Economics, Finance and Management     
Copyrights
© 2015 Journal of Computing