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.