Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4635269 | Applied Mathematics and Computation | 2007 | 10 Pages |
Abstract
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).
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Soubhik Chakraborty, Suman Kumar Sourabh,