SAT encodings for sorting networks, single-exception sorting networks and ε-halvers

by   José A. R. Fonollosa, et al.

Sorting networks are oblivious sorting algorithms with many practical applications and rich theoretical properties. Propositional encodings of sorting networks are a key tool for proving concrete bounds on the minimum number of comparators or depth (number of parallel steps) of sorting networks. In this paper, we present new SAT encodings that reduce the number of variables and clauses of the sorting constraint of optimality problems. Moreover, the proposed SAT encodings can be applied to a broader class of problems, such as the search of optimal single-exception sorting networks and ϵ-halvers. We obtain optimality results for single-exception sorting networks on n < 10 inputs.


page 1

page 2

page 3

page 4


Joint Size and Depth Optimization of Sorting Networks

Sorting networks are oblivious sorting algorithms with many interesting ...

An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels

We show that 11-channel sorting networks have at least 35 comparators an...

Constant-Depth Sorting Networks

In this paper, we address sorting networks that are constructed from com...

Fast geometric trim fitting using partial incremental sorting and accumulation

We present an algorithmic contribution to improve the efficiency of robu...

Sorting wild pigs

Chjara, breeder in Cargèse, has n wild pigs. She would like to sort her ...

PicArrange – Visually Sort, Search, and Explore Private Images on a Mac Computer

The native macOS application PicArrange integrates state-of-the-art imag...

A Real-time Cargo Damage Management System via a Sorting Array Triangulation Technique

This report covers an intelligent decision support system (IDSS), which ...

Code Repositories

Please sign up or login with your details

Forgot password? Click here to reset