A note on non-deterministic communication complexity with few witnesses

Vince Grolmusz, Gábor Tardos

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)387-391
Number of pages5
JournalTheory of Computing Systems
Volume36
Issue number4
DOIs
Publication statusPublished - Jul 2003

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'A note on non-deterministic communication complexity with few witnesses'. Together they form a unique fingerprint.

  • Cite this