Sorting nine inputs requires twenty-five comparisons
详细信息    查看全文
文摘

Twenty-five comparators are minimal to sort nine inputs.

Twenty-nine comparators are minimal to sort ten inputs.

New symmetry-breaking results control the growth of the search space.

Optimized and parallelized algorithms for generating size-optimal sorting networks.

Use of SAT-solving to speed up the last part of the computation.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700