eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2023-02-01
43:1
43:19
10.4230/LIPIcs.ITCS.2023.43
article
Constant-Depth Sorting Networks
Dobrokhotova-Maikova, Natalia
1
Kozachinskiy, Alexander
2
3
https://orcid.org/0000-0002-9956-9023
Podolskii, Vladimir
4
5
https://orcid.org/0000-0001-7154-138X
Yandex, Moscow, Russia
Institute for Mathematical and Computational Engineering, Universidad Católica de Chile, Santiago, Chile
IMFD & CENIA Chile, Santiago, Chile
Courant Institute of Mathematical Sciences, New York University, NY, USA
Steklov Mathematical Institute of Russian Academy of Sciences, Moscow, Russia
In this paper, we address sorting networks that are constructed from comparators of arity k > 2. I.e., in our setting the arity of the comparators - or, in other words, the number of inputs that can be sorted at the unit cost - is a parameter. We study its relationship with two other parameters - n, the number of inputs, and d, the depth.
This model received considerable attention. Partly, its motivation is to better understand the structure of sorting networks. In particular, sorting networks with large arity are related to recursive constructions of ordinary sorting networks. Additionally, studies of this model have natural correspondence with a recent line of work on constructing circuits for majority functions from majority gates of lower fan-in.
Motivated by these questions, we initiate the studies of lower bounds for constant-depth sorting networks. More precisely, we consider sorting networks of constant depth d and estimate the minimal k for which there is such a network with comparators of arity k. We prove tight lower bounds for d ≤ 4. More precisely, for depths d = 1,2 we observe that k = n. For d = 3 we show that k = ⌈n/2⌉. As our main result, we show that for d = 4 the minimal arity becomes sublinear: k = Θ(n^{2/3}). This contrasts with the case of majority circuits, in which k = O(n^{2/3}) is achievable already for depth d = 3. To prove these results, we develop a new combinatorial technique based on the notion of access to cells of a sorting network.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol251-itcs2023/LIPIcs.ITCS.2023.43/LIPIcs.ITCS.2023.43.pdf
Sorting networks
constant depth
lower bounds
threshold circuits