Communication complexity in a 3-computer model

DOI10.1007/BF01955678zbMath0858.68045OpenAlexW2069738973MaRDI QIDQ1924405

Andris Ambainis

Publication date: 16 October 1996

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01955678

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Computer system organization (68M99)

Related Items (8)

The communication complexity of the Hamming distance problem ⋮ Equality, Revisited ⋮ QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS ⋮ Unnamed Item ⋮ Distinguishing two probability ensembles with one sample from each ensemble ⋮ Public vs. private randomness in simultaneous multi-party communication complexity ⋮ Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity ⋮ Quantum communication and complexity.

Cites Work

• Unnamed Item

This page was built for publication: Communication complexity in a 3-computer model