Presentation	1997/12/9 Minimum number of Comparators in (4, 7)-merging network and (5, 6)-merging network Takehisa Tanno, Shigeki Iwata,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Let M(m, n) denote the minimum number of comparators in (m, n)-merging networks. We show that M(4, 7)=16, and M(5, 6)=16. In the report, we assume that both (4, 7)- and (5,6)-merging networks consist of 15 comparators. We have constructed every network which has 15 comparators, and have examined that it is neither (4, 7)- or (5, 6)-merging network, by using of computers. The computation was carried out by six workstations in parallel to make the computation time short.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	merging networks / minimum number of comparators / computer computation
Paper #	COMP97-77
Date of Issue

Conference Information
Committee	COMP
Conference Date	1997/12/9(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Theoretical Foundations of Computing (COMP)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Minimum number of Comparators in (4, 7)-merging network and (5, 6)-merging network
Sub Title (in English)
Keyword(1)	merging networks
Keyword(2)	minimum number of comparators
Keyword(3)	computer computation
1st Author's Name	Takehisa Tanno
1st Author's Affiliation	Department of Computer Science and Information Mathematics, The University of Electro-Communications()
2nd Author's Name	Shigeki Iwata
2nd Author's Affiliation	Department of Computer Science and Information Mathematics, The University of Electro-Communications
Date	1997/12/9
Paper #	COMP97-77
Volume (vol)	vol.97
Number (no)	420
Page	pp.pp.-
#Pages	8
Date of Issue