Dice Question Streamline Icon: https://streamlinehq.com

One-sided vs. two-sided error in constant-cost randomized communication

Determine the relationship between one-sided-error and two-sided-error public-coin randomized protocols in the constant-cost regime; specifically, ascertain whether the class of communication problems computable with constant-cost one-sided-error protocols coincides with (or is strictly weaker than) the class of problems computable with constant-cost two-sided-error protocols.

Information Square Streamline Icon: https://streamlinehq.com

Background

The paper studies the class BPP of communication problems solvable with constant-cost public-coin randomized protocols. While the authors resolve the existence of a complete problem (showing none exists), they note that key questions about error models remain unresolved even under this constant-cost restriction. Clarifying the power of one-sided versus two-sided error in this regime would sharpen our understanding of how randomness is used most efficiently in communication protocols.

References

Some open problems about randomized communication remain open even when restricted to their BPP versions, including the size of monochromatic rectangles [CLV19,HHH23eccc], the role of one- vs.~two-sided error and the existence of a complete problem.

No Complete Problem for Constant-Cost Randomized Communication (2404.00812 - Fang et al., 31 Mar 2024) in Section 1 (Introduction)