On why an algorithmic time complexity measure can be system invariant rather than system independent (Q2383744): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.amc.2007.01.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2090240628
@@ Property / OpenAlex ID: W2090240628 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithm for sparse matrix multiplication
@@ Property / cites work: Fast algorithm for sparse matrix multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398794
@@ Property / cites work: Q4398794 / rank @@
+Normal rank
@@ Property / cites work @@
+Can a randomized binary search have an \(O(1)\) complexity at least in practice?
+Normal rank
@@ Property / cites work @@
+A simple empirical formula for categorizing computing operations
+Normal rank
@@ Property / cites work @@
+Replacement sort revisited: The ``gold standard'' unearthed!
+Normal rank
@@ Property / cites work @@
+A statistical analysis of an algorithm's complexity
+Normal rank
@@ Property / cites work @@
+Can statistics provide a realistic measure for an algorithm's complexity?
+Normal rank
@@ Property / cites work @@
+Q4125602
@@ Property / cites work: Q4125602 / rank @@
+Normal rank