A comparison of two lower-bound methods for communication complexity
type: Item
instance of: scholarly article
title: A comparison of two lower-bound methods for communication complexity
zbMATH Open document ID: 0874.68150
DOI: 10.1016/S0304-3975(96)00062-X
author: Martin Dietzfelbinger
author: Juraj Hromkovič
author: Georg Schnitger
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q11
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 984227
MaRDI profile type: Publication
cites work: Q3241211
cites work: Q3726125
cites work: Q5532610
cites work: Q5633357
cites work: Q4385521
cites work: On the ratio of optimal integral and fractional covers
cites work: Q5203681
cites work: Average and randomized communication complexity
full work available at URL: s0304-3975(96)00062-x
OpenAlex ID: W1580860198
description: scientific article; zbMATH DE number 984227