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

作者：

Highlights：

•

摘要

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).

论文关键词：Amir Schoor’s algorithm,Sparse matrices,Dense matrices,Average case complexity,Big oh

论文评审过程：Available online 18 January 2007.

论文官网地址：https://doi.org/10.1016/j.amc.2007.01.016