On why an algorithmic time complexity measure can be system invariant rather than system independent

被引：7

作者：

Chakraborty, Soubhk ^{[1
]}

Sourabh, Suman Kumar

机构：

[1] TM Bhagalpur Univ, Marwari Coll, Dept Stat, Bhagalpur 812007, India

[2] TM Bhagalpur Univ, Dept Stat & Comp Applicat, Bhagalpur 812007, India

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2007年 / 190卷 / 01期

关键词：

Amir Schoor's algorithm; sparse matrices; dense matrices; average case complexity; big oh;

D O I：

10.1016/j.amc.2007.01.016

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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). (C) 2007 Elsevier Inc. All rights reserved.

引用

页码：195 / 204

页数：10