A linear lower bound on the unbounded error probabilistic communication complexity.
type: Item
instance of: scholarly article
title: A linear lower bound on the unbounded error probabilistic communication complexity.
zbMATH Open document ID: 1058.68058
DOI: 10.1016/S0022-0000(02)00019-3
author: Jürgen Forster
published in: Journal of Computer and System Sciences
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 15A60
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 1910852
zbMATH Keywords: probabilistic communication complexity
zbMATH Keywords: Hadamard matrix
zbMATH Keywords: spectral norm
zbMATH Keywords: lower bounds
MaRDI profile type: Publication
cites work: Q4781229
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Q4474216
cites work: Q4781230
cites work: Relative loss bounds for temporal-difference learning
cites work: Matrix Analysis
cites work: Geometric arguments yield better bounds for threshold circuits and distributed computing
cites work: Communication Complexity
cites work: Probabilistic communication complexity
cites work: Q4405392
cites work: Q4261789
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
full work available at URL: s0022-0000(02)00019-3
OpenAlex ID: W2143355494
description: scientific article; zbMATH DE number 1910852