A statistical analysis of an algorithm’s complexity

Applied Mathematics Letters

Volumn 13, Issue 5, 2000, Pages 121-126

  Chakraborty, S ^a   Choudhury, P P ^b  

^a T M BHAGALPUR UNIVERSITY   (India)

^b INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Algorithm; Computational complexity; Statistical analysis

Indexed keywords

EID: 14244260378     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(00)00043-4     Document Type: Article

References (7)

1. Draper N., Smith H. Second Edition Applied Regression Analysis. 1981;John Wiley & Sons.
2. Knuth D.E. Fundamental Algorithm. 1:1973;Addison-Wesley.
3. Knuth D.E. Sorting and Searching. 3:1973;Addision-Wesley.
4. T. Standish, Data Structures, Algorithms and Software Principles, Addison-Wesley.
5. H. Freeman, Mathematics for Actuarial Students, Part II, Cambridge University Press.
6. S.C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, Sultan Chand & Sons.
7. J. Scarborough, Numerical Mathematical Analysis, Johns Hopkins Press.