New bounds on the half-duplex communication complexity
type: Item
instance of: scholarly article
title: New bounds on the half-duplex communication complexity
zbMATH Open document ID: 1490.68107
DOI: 10.1007/978-3-030-67731-2_17
author: Yuriy Dementiev
author: Artur Ignatiev
author: Vyacheslav Sidelnik
author: Mikhail Ushakov
author: Alexander V. Smal
publication date: 2022-03-24T00:00:00Z
Mathematics Subject Classification ID: 68Q11
zbMATH DE Number: 7497731
zbMATH Keywords: communication complexity
zbMATH Keywords: half-duplex communication
zbMATH Keywords: Karchmer-Wigderson games
MaRDI profile type: Publication
full work available at URL: 978-3-030-67731-2 17
OpenAlex ID: W3082816628
cites work: On the depth complexity of the counting functions
cites work: Elements of Information Theory
cites work: Q5091000
cites work: Super-logarithmic depth lower bounds via the direct sum in communication complexity
cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth
cites work: Complexity of the realization of a linear function in the class of \(\Pi\)-circuits
cites work: Communication Complexity
cites work: The quantum adversary method and classical formula size power bounds
description: scientific article; zbMATH DE number 7497731