The cost of the missing bit: Communication complexity with help
type: Item
instance of: scholarly article
title: The cost of the missing bit: Communication complexity with help
zbMATH Open document ID: 0996.68057
author: László Babai
author: Thomas P. Hayes
author: Peter G. Kimmel
published in: Combinatorica
publication date: 2002-10-20T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 1817671
zbMATH Keywords: communication complexity
MaRDI profile type: Publication
full work available at URL: s004930100009
OpenAlex ID: W2611355853
DOI: 10.1007/S004930100009
Recommended article: Q4542591
Recommended article: The value of help bits in randomized and average-case complexity
Recommended article: Nondeterministic communication complexity with help and graph functions
Recommended article: The communication complexity of addition
Recommended article: Communication complexity with defective randomness
Recommended article: On the complexity of communication complexity
Recommended article: STACS 2004
Recommended article: Non-deterministic communication complexity with few witnesses
Recommended article: The cost of fault tolerance in multi-party communication complexity
description: scientific article; zbMATH DE number 1817671