Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Suman Kumar Sourabh"'
Publikováno v:
Anale: Seria Informatică, Vol VII, Iss 2, Pp 87-96 (2009)
A lot has been done on the randomness of the decimal expansion of Pi with extensive tests of randomness that are used to distinguish good from not-so-good random number generators when applied to the decimal digits of Pi. Pi seems to pass these tests
Externí odkaz:
https://doaj.org/article/595edb78c182417d90f8502af91725fa
On why an algorithmic time complexity measure can be system invariant rather than system independent
Publikováno v:
Applied Mathematics and Computation. 190:195-204
The present paper argues that it suffices for an algorithmic time complexity measure to be system invariant rather than system independent (which means predicting from the desk).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c18f566aa752a168a710f7ec49f1e32
https://doi.org/10.1016/j.amc.2007.01.016
https://doi.org/10.1016/j.amc.2007.01.016
Publikováno v:
Applied Mathematics and Computation. 189:384-394
The present paper shows that for certain algorithms such as sorting, the parameters of the input distribution must also be taken into account, apart from the input size, for a more precise evaluation of computational and time complexity (average case
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4907f4c0516a23721c1cc5c76a5fa830
https://doi.org/10.1016/j.amc.2006.11.093
https://doi.org/10.1016/j.amc.2006.11.093
Publikováno v:
Applied Mathematics and Computation. 189:1787-1797
In the present paper, the authors reject one of Knuth’s well known results on average case complexity in replacement (i.e. selection) sort and hence challenge the robustness of average complexity measures where the response variable is sensitive to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f876152c1c023d7bee2575c05451adb
https://doi.org/10.1016/j.amc.2006.12.068
https://doi.org/10.1016/j.amc.2006.12.068