DocumentCode
230280
Title
Confidence complexity of computer algorithms
Author
Kiktenko, A.A. ; Lunkovskiy, M.N. ; Nikiforov, K.A.
Author_Institution
St. Peterburg State Univ., St. Petersburg, Russia
fYear
2014
fDate
June 30 2014-July 4 2014
Firstpage
1
Lastpage
4
Abstract
A statistical research of an algorithm complexity as a random value was carried out via numerical experimentation using parallel computation. For a segment of input data sizes point characteristics for this random value and its confidence interval are obtained. Confidence complexity function value based on gamma-distribution is determined. The following result have been obtained: the used criteria are adequate for predicting the mean execution time and its confidence intervals for given input types.
Keywords
computational complexity; gamma distribution; parallel processing; algorithm complexity; computer algorithms; confidence complexity; confidence interval; gamma distribution; parallel computation; Complexity theory; Computational modeling; Computers; Correlation; Mathematical model; Software; Software algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Emission Electronics (ICEE), 2014 2nd International Conference on
Conference_Location
St. Petersburg
Type
conf
DOI
10.1109/Emission.2014.6893971
Filename
6893971
Link To Document