Sorting Short Integers

02/19/2021 ∙ by Michal Koucký, et al. ∙ 0

We build boolean circuits of size O(nm^2) and depth O(log(n) + m log(m)) for sorting n integers each of m-bits. We build also circuits that sort n integers each of m-bits according to their first k bits that are of size O(nmk(1 + log^*(n) - log^*(m))) and depth O(log^3(n)). This improves on the result of Asharov et al. arXiv:2010.09884 and resolves some of their open questions.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.