Determinism vs. Nondeterminism in Multiparty Communication Complexity

DOI10.1137/0221052zbMath0765.68033OpenAlexW2003007405MaRDI QIDQ4015973

Danny Dolev, Tomás Feder

Publication date: 6 December 1992

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0221052

zbMATH Keywords

Boolean functioncommunication complexitymultiparty protocols

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Partition arguments in multiparty communication complexity ⋮ Message lower bounds via efficient network synchronization ⋮ Message Lower Bounds via Efficient Network Synchronization ⋮ Construction of Very Hard Functions for Multiparty Communication Complexity

This page was built for publication: Determinism vs. Nondeterminism in Multiparty Communication Complexity