This paper studies properties of the back end of a sorting network and illustrates the utility of these in the search for networks of optimal size or depth. All previous works focus on properties of the front end of networks and on how to apply these to break symmetries in the search. The new properties help shed understanding on how sorting networks sort and speed-up solvers for both optimal size and depth by an order of magnitude.
CITATION STYLE
Codish, M., Cruz-Filipe, L., & Schneider-Kamp, P. (2015). Sorting networks: The end game. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8977, pp. 664–675). Springer Verlag. https://doi.org/10.1007/978-3-319-15579-1_52
Mendeley helps you to discover research relevant for your work.