scientific article; zbMATH DE number 7561364

DOI10.4230/LIPIcs.ISAAC.2018.10MaRDI QIDQ5091000

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

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

information theorycommunication complexityhalf-duplex channel

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

New bounds on the half-duplex communication complexity ⋮ Toward better depth lower bounds: two results on the multiplexor relation

Cites Work

• Unnamed Item
• Communication complexity towards lower bounds on circuit depth
• Super-logarithmic depth lower bounds via the direct sum in communication complexity
• Method of determining lower bounds for the complexity of \(\Pi\)-circuits
• Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation
• Communication Complexity
• Interactive coding over the noisy broadcast channel
• Elements of Information Theory

This page was built for publication: