Sorting nine inputs requires twenty-five comparisons

Michael Codish; Luís Cruz-Filipe; Michael Frank; Peter Schneider-Kamp

doi:10.1016/j.jcss.2015.11.014

Sorting nine inputs requires twenty-five comparisons

Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Abstract

This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting of 24 comparators, hence showing that the 25-comparator sorting network found by Floyd in 1964 is optimal. As a corollary, the 29-comparator network found by Waksman in 1969 is optimal when sorting 10 inputs. This closes the two smallest open instances of the optimal-size sorting network problem, which have been open since the results of Floyd and Knuth from 1966 proving optimality for sorting networks of up to 8 inputs.

Original language	American English
Pages (from-to)	551-563
Number of pages	13
Journal	Journal of Computer and System Sciences
Volume	82
Issue number	3
DOIs	https://doi.org/10.1016/j.jcss.2015.11.014
State	Published - 1 Jan 2016

Keywords

Computer-assisted proofs
SAT solving
Sorting networks
Symmetry breaking

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science
Computer Networks and Communications
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1016/j.jcss.2015.11.014

Cite this

@article{79be6ef69ab3435ab1658ab1ca8fa513,

title = "Sorting nine inputs requires twenty-five comparisons",

abstract = "This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting of 24 comparators, hence showing that the 25-comparator sorting network found by Floyd in 1964 is optimal. As a corollary, the 29-comparator network found by Waksman in 1969 is optimal when sorting 10 inputs. This closes the two smallest open instances of the optimal-size sorting network problem, which have been open since the results of Floyd and Knuth from 1966 proving optimality for sorting networks of up to 8 inputs.",

keywords = "Computer-assisted proofs, SAT solving, Sorting networks, Symmetry breaking",

author = "Michael Codish and Lu{\'i}s Cruz-Filipe and Michael Frank and Peter Schneider-Kamp",

year = "2016",

month = jan,

day = "1",

doi = "10.1016/j.jcss.2015.11.014",

language = "American English",

volume = "82",

pages = "551--563",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Sorting nine inputs requires twenty-five comparisons

AU - Codish, Michael

AU - Cruz-Filipe, Luís

AU - Frank, Michael

AU - Schneider-Kamp, Peter

PY - 2016/1/1

Y1 - 2016/1/1

N2 - This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting of 24 comparators, hence showing that the 25-comparator sorting network found by Floyd in 1964 is optimal. As a corollary, the 29-comparator network found by Waksman in 1969 is optimal when sorting 10 inputs. This closes the two smallest open instances of the optimal-size sorting network problem, which have been open since the results of Floyd and Knuth from 1966 proving optimality for sorting networks of up to 8 inputs.

AB - This paper describes a computer-assisted non-existence proof of 9-input sorting networks consisting of 24 comparators, hence showing that the 25-comparator sorting network found by Floyd in 1964 is optimal. As a corollary, the 29-comparator network found by Waksman in 1969 is optimal when sorting 10 inputs. This closes the two smallest open instances of the optimal-size sorting network problem, which have been open since the results of Floyd and Knuth from 1966 proving optimality for sorting networks of up to 8 inputs.

KW - Computer-assisted proofs

KW - SAT solving

KW - Sorting networks

KW - Symmetry breaking

UR - http://www.scopus.com/inward/record.url?scp=84950264544&partnerID=8YFLogxK

U2 - 10.1016/j.jcss.2015.11.014

DO - 10.1016/j.jcss.2015.11.014

M3 - Article

SN - 0022-0000

VL - 82

SP - 551

EP - 563

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 3

ER -

Sorting nine inputs requires twenty-five comparisons

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this