Sorting Networks: The End Game

DOI10.1007/978-3-319-15579-1_52zbMath1423.68443arXiv1411.6408OpenAlexW3103995256MaRDI QIDQ2799216

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

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.6408

zbMATH Keywords

symmetry breakingsorting networksSAT-solving

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Optimizing sorting algorithms by using sorting networks ⋮ Optimal-depth sorting networks ⋮ Merging almost sorted sequences yields a 24-sorter ⋮ New Bounds on Optimal Sorting Networks ⋮ Sorting networks: to the end and back again ⋮ Applying Sorting Networks to Synthesize Optimized Sorting Libraries

This page was built for publication: Sorting Networks: The End Game