On the connection between Hamming codes, Heapsort and other methods (Q2444852): Difference between revisions

@@ Property / describes a project that uses @@
+heapsort
@@ Property / describes a project that uses: heapsort / rank @@
+Normal rank
@@ 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.ipl.2013.05.013
+Normal rank
@@ Property / OpenAlex ID @@
+W2053321732
@@ Property / OpenAlex ID: W2053321732 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3795602
@@ Property / cites work: Q3795602 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2444852