A note on non-deterministic communication complexity with few witnesses was presented. The results of the study of the power of bounded randomness, and the power of bounded non-determinism were also presented. It was derived that every non-deterministic communication protocol for computing function (f) corresponds to a cover of communication matrix (Mf) by rectangles.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computational Theory and Mathematics