TY  - JOUR
T1  - On the Philosophy of Statistical Bounds: A Case Study on a Determinant Algorithm
AU - , Soubhik Chakraborty AU - , Charu Wahi AU - , Suman Kumar Sourabh AU - , Lopamudra Ray Saraswatid AU - , Avi Mukherjee 
JO  - Journal of Modern Mathematics and Statistics
VL  - 1
IS  - 1
SP  - 15
EP  - 23
PY  - 2007
DA  - 2001/08/19
SN  - 1994-5388
DO  - jmmstat.2007.15.23
UR  - https://makhillpublications.co/view-article.php?doi=jmmstat.2007.15.23
KW  - Determinant
KW  -statistical algorithmic complexity
KW  -statistical bound
KW  -empirical O
AB  - Under the umbrella of statistical algorithmic complexity (which some authors call stochastic arithmetic) , it makes sense to talk about statistical bounds (asymptotic) and their empirical estimates over a finite range (a computer experiment cannot be run for infinite input size!), the so called empirical O, which were informally introduced in Chakraborty and Sourabh where it was shown that they make average complexity more meaningful. The present study shows that these concepts can be used effectively in worst cases  as well as in best cases besides average cases with a case study on an efficient determinant algorithm.
ER  -