Different Modes of Communication

DOI10.1137/0222057zbMath0782.68065OpenAlexW2031208839MaRDI QIDQ3142585

Bernd Halstenberg, K. Ruediger Reischuk

Publication date: 13 March 1994

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

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

zbMATH Keywords

probabilistic protocols\(k\)-round protocols

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Communication theory (94A05) Distributed algorithms (68W15)

Related Items (7)

Around the log-rank conjecture ⋮ Approximation of boolean functions by combinatorial rectangles ⋮ Lower bounds for one-way probabilistic communication complexity ⋮ New lower bounds and hierarchy results for restricted branching programs ⋮ The communication complexity of pointer chasing ⋮ Nondeterministic and randomized Boolean hierarchies in communication complexity ⋮ Computing (and Life) Is All about Tradeoffs

This page was built for publication: Different Modes of Communication