New bounds on the half-duplex communication complexity

DOI10.1007/978-3-030-67731-2_17zbMath1490.68107OpenAlexW3082816628MaRDI QIDQ831813

Mikhail Ushakov, Artur Ignatiev, Yuriy Dementiev, Vyacheslav Sidelnik, Alexander V. Smal

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_17

zbMATH Keywords

communication complexityhalf-duplex communicationKarchmer-Wigderson games

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• On the depth complexity of the counting functions
• Super-logarithmic depth lower bounds via the direct sum in communication complexity
• The quantum adversary method and classical formula size power bounds
• Complexity of the realization of a linear function in the class of \(\Pi\)-circuits
• Monotone Circuits for Connectivity Require Super-Logarithmic Depth
• Communication Complexity
• Elements of Information Theory

This page was built for publication: New bounds on the half-duplex communication complexity