Determinism vs. Nondeterminism in Multiparty Communication Complexity

DOI10.1137/0221052zbMATH Open0765.68033OpenAlexW2003007405MaRDI QIDQ4015973FDOQ4015973

Authors: 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

Recommendations

• Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
• Lower bounds on the multiparty communication complexity
• Improved Separations between Nondeterministic and Randomized Multiparty Communication
• Different Modes of Communication
• Non-deterministic communication complexity with few witnesses

zbMATH Keywords

Boolean functioncommunication complexitymultiparty protocols

Mathematics Subject Classification ID

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

Cited In (8)

• Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
• Partition arguments in multiparty communication complexity
• Construction of Very Hard Functions for Multiparty Communication Complexity
• Information Transfer under Different Sets of Protocols
• Communication complexity of multi-processor systems
• Message lower bounds via efficient network synchronization
• Message Lower Bounds via Efficient Network Synchronization
• Tensor rank and strong quantum nondeterminism in multiparty communication

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015973)