Half-duplex communication complexity

Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander Smal

Research output: Book/ReportReport


Changes to previous version:
In the previous versions on this paper including the conference version we claimed better lower bounds for IPn in all tree half-duplex models based on an information theoretic approach.
Unfortunately, proofs of these results (Theorems 18, 21, and 24) contain a critical flaw (Lemma~13 in is not true).
Moreover, as far as we know, this flaw can not be fixed --- there is an upper bound of n2+2 on half-duplex complexity of IPn with silence (proven by Tatiana Gladysh) that matches the lower bound proven here up to an additive constant 2.
This upper bound contradicts the lower bound claimed in the previous versions of the paper.
All these theorems were removed from the paper preserving numeration of other theorems.
Original languageAmerican English
StatePublished - 2018


Dive into the research topics of 'Half-duplex communication complexity'. Together they form a unique fingerprint.

Cite this