A note on the partition bound for one-way classical communication complexity

Srinivasan Arunachalam, João F. Doriguello, Joao F. Doriguello +1

We present a linear program for a one-way version of the partition bound of Jain and Klauck, denoted ${\mathsf{prt}}_{\epsilon }^1(f)$, and show that it characterizes the one-way ran…