Half-duplex communication complexity

DOI10.4230/LIPICS.ISAAC.2018.10MaRDI QIDQ5091000zbMATH OpenFDO

Authors Kenneth R. Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander V. Smal

Publication date 21 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2018.10

zbMATH Keywords

communication complexityhalf-duplex channelinformation theory

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• New bounds on the half-duplex communication complexity
• Different Modes of Communication
• scientific article; zbMATH DE number 1769898
• Communication complexity
• Communication complexity

Cites work

• Communication Complexity
• Communication complexity towards lower bounds on circuit depth
• Elements of Information Theory
• scientific article; zbMATH DE number 549856 (Why is no real title available?)
• Interactive coding over the noisy broadcast channel
• Method of determining lower bounds for the complexity of \(\Pi\)-circuits
• Super-logarithmic depth lower bounds via the direct sum in communication complexity
• Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation

Cited in

(4)

• Toward better depth lower bounds: a KRW-like theorem for strong composition
• Half-duplex communication complexity with adversary can be less than the classical communication complexity
• Toward better depth lower bounds: two results on the multiplexor relation
• New bounds on the half-duplex communication complexity

This page was built for publication: Half-duplex communication complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091000)