Minimum Number of Comparators in (6, 6)-Merging Network

概要

論文の詳細を見る
The minimum number of comparators in a (6, 6)-merging network is shown to be 17. The number has been known to be either 16 or 17 [See Knuth, The Art of Computer Programming Vol.3: Sorting and Searching, p.230]. Minimum numbers for (n, n)-merging networks, 1≤n≤9, n≠6, were already known. The problem had been open for more than two decades.
社団法人電子情報通信学会の論文
2000-02-25