Nondeterministic Communication Complexity of Random Boolean Functions
Discrete Mathematics
2016-12-05 v2 Computational Complexity
Abstract
We study nondeterministic communication complexity and related concepts (fooling sets, fractional covering number) of random functions where each value is chosen to be 1 independently with probability , .
Keywords
Cite
@article{arxiv.1611.08400,
title = {Nondeterministic Communication Complexity of Random Boolean Functions},
author = {Mozhgan Pourmoradnasseri and Dirk Oliver Theis},
journal= {arXiv preprint arXiv:1611.08400},
year = {2016}
}
Comments
Version with proofs (in the appendix). Extended abstract appeared in Proceedings of Theory and Applications of Models of Computation, TAMC, 2016