Authors
Soubhik Chakraborty, Suman Kumar Sourabh
Publication date
2007/7/1
Journal
Applied Mathematics and Computation
Volume
190
Issue
1
Pages
195-204
Publisher
Elsevier
Description
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).
Total citations
Scholar articles
On why an algorithmic time complexity measure can be system invariant rather than system independent
S Chakraborty, SK Sourabh - Applied Mathematics and Computation, 2007