A note on non-deterministic communication complexity with few witnesses

DOI10.1007/S00224-003-1158-7zbMath1040.68048OpenAlexW2006699094MaRDI QIDQ1405785

Gábor Tardos, Vince Grolmusz

Publication date: 26 August 2003

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-003-1158-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

The landscape of communication complexity classes ⋮ Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Deterministic Communication vs. Partition Number ⋮ Communication Complexity of Pairs of Graph Families with Applications

This page was built for publication: A note on non-deterministic communication complexity with few witnesses