Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
From MaRDI portal
Publication:5428804
DOI10.1007/978-3-540-73420-8_14zbMath1171.68480OpenAlexW1568582273MaRDI QIDQ5428804
Toniann Pitassi, Philipp Woelfel, Matei David, P. W. Beame
Publication date: 28 November 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_14
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (7)
Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols ⋮ Nondeterministic communication complexity with help and graph functions ⋮ The hardest halfspace ⋮ One-way multiparty communication lower bound for pointer jumping with applications ⋮ Unnamed Item ⋮ A note on multiparty communication complexity and the Hales-Jewett theorem ⋮ The Multiparty Communication Complexity of Set Disjointness
This page was built for publication: Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
