A statistical analysis of an algorithm's complexity
From MaRDI portal
Publication:1585523
DOI10.1016/S0893-9659(00)00043-4zbMath0965.68139OpenAlexW2054071769MaRDI QIDQ1585523
Publication date: 16 November 2000
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0893-9659(00)00043-4
Related Items (8)
A simple empirical formula for categorizing computing operations ⋮ Replacement sort revisited: The ``gold standard unearthed! ⋮ Winograd's algorithm statistically revisited: it pays to weigh than to count! ⋮ Software complexity: a statistical case study through insertion sort ⋮ On why an algorithmic time complexity measure can be system invariant rather than system independent ⋮ Can statistics provide a realistic measure for an algorithm's complexity? ⋮ Generation techniques for linear programming instances with controllable properties ⋮ A mixed evolutionary-statistical analysis of an algorithm's complexity
Cites Work
This page was built for publication: A statistical analysis of an algorithm's complexity
