DeepAI AI Chat
Log In Sign Up

Multiparty Karchmer-Wigderson Games and Threshold Circuits

by   Alexander Kozachinskiy, et al.
University of Warwick

We suggest a generalization of Karchmer-Wigderson communication games to the multiparty setting. Our generalization turns out to be tightly connected to circuits consisting of threshold gates. This allows us to obtain new explicit constructions of such circuits for several functions. In particular, we provide an explicit (polynomial-time computable) log-depth monotone formula for Majority function, consisting only of 3-bit majority gates and variables. This resolves a conjecture of Cohen et al. (CRYPTO 2013).


page 1

page 2

page 3

page 4


Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits

In order to formally understand the power of neural computing, we first ...

Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits

We show average-case lower bounds for explicit Boolean functions again...

Constant-depth circuits vs. monotone circuits

We establish new separations between the power of monotone and general (...

Circuits via topoi

Leveraging topos theory a semantics can be given to sequential circuits ...

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage

Comparator circuits are a natural circuit model for studying bounded fan...

Tight Correlation Bounds for Circuits Between AC0 and TC0

We initiate the study of generalized AC0 circuits comprised of negations...

Constant-Depth Sorting Networks

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