A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth

Gerth Stølting Brodal, Thore Husfeldt

Abstract


We present a direct protocol with logarithmic communication that
finds an element in the symmetric difference of two sets of different size. This
yields a simple proof that symmetric functions have logarithmic circuit depth.

Full Text:

PDF


DOI: http://dx.doi.org/10.7146/brics.v3i1.19502
This website uses cookies to allow us to see how the site is used. The cookies cannot identify you or any content at your own computer.
OK


ISSN: 0909-0878 

Hosted by the State and University Library and Aarhus University Library