On the connection between Hamming codes, Heapsort and other methods (Q2444852): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3795602 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems / rank | |||
Normal rank | |||
Latest revision as of 15:15, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the connection between Hamming codes, Heapsort and other methods |
scientific article |
Statements
On the connection between Hamming codes, Heapsort and other methods (English)
0 references
11 April 2014
0 references
design of algorithms
0 references
Hamming codes
0 references
Heapsort
0 references
binary search
0 references
subset sum problem
0 references
