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

DOI10.1016/j.amc.2007.01.016zbMath1123.68047OpenAlexW2090240628MaRDI QIDQ2383744

Soubhik Chakraborty, Suman Kumar Sourabh

Publication date: 19 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.01.016

zbMATH Keywords

sparse matricesdense matricesaverage case complexityAmir Schoor's algorithmbig oh

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Related Items (1)

Software complexity: a statistical case study through insertion sort

Cites Work

• Fast algorithm for sparse matrix multiplication
• A statistical analysis of an algorithm's complexity
• Can statistics provide a realistic measure for an algorithm's complexity?
• A simple empirical formula for categorizing computing operations
• Replacement sort revisited: The ``gold standard unearthed!
• Can a randomized binary search have an \(O(1)\) complexity at least in practice?
• Unnamed Item
• Unnamed Item

This page was built for publication: On why an algorithmic time complexity measure can be system invariant rather than system independent