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

DOI10.1016/J.AMC.2007.01.016MaRDI QIDQ2383744zbMATH OpenOpenAlexFDO

Authors 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

Amir Schoor's algorithmaverage case complexitybig ohdense matricessparse matrices

Mathematics Subject Classification ID

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

Cites work

• A simple empirical formula for categorizing computing operations
• A statistical analysis of an algorithm's complexity
• Can a randomized binary search have an \(O(1)\) complexity at least in practice?
• Can statistics provide a realistic measure for an algorithm's complexity?
• Fast algorithm for sparse matrix multiplication
• scientific article; zbMATH DE number 3551729 (Why is no real title available?)
• scientific article; zbMATH DE number 1179053 (Why is no real title available?)
• Replacement sort revisited: The ``gold standard unearthed!

Cited in

(1)

• Software complexity: a statistical case study through insertion sort

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383744)