Hadamard tensors and lower bounds on multiparty communication complexity
type: Item
instance of: scholarly article
title: Hadamard tensors and lower bounds on multiparty communication complexity
zbMATH Open document ID: 1286.68189
author: Jeff Ford
author: Anna Gál
published in: Computational Complexity
publication date: 2013-09-30T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2006/607/
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 6212887
zbMATH Keywords: communication complexity
zbMATH Keywords: lower bounds
zbMATH Keywords: multiparty communication
MaRDI profile type: Publication
OpenAlex ID: W2027624900
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Q4542591
cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
cites work: Multiparty Communication Complexity and Threshold Circuit Size of AC^0
cites work: On ACC
cites work: Q4141008
cites work: Rounds in Communication Complexity Revisited
cites work: Boolean Circuits, Tensor Ranks, and Communication Complexity
cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
cites work: Quasi‐random classes of hypergraphs
cites work: Communication Complexity and Quasi Randomness
cites work: Q4065548
cites work: The BNS lower bound for multi-party protocols is nearly optimal
cites work: On the power of small-depth threshold circuits
cites work: A Hadamard matrix of order 428
cites work: Lower Bounds for Quantum Communication Complexity
cites work: Communication Complexity
cites work: Disjointness is hard in the multiparty number-on-the-forehead model
cites work: Q4002255
cites work: Q4230829
cites work: Unexpected upper bounds on the complexity of some communication games
cites work: The BNS-Chung criterion for multi-party communication complexity
cites work: New Algorithms for Finding Irreducible Polynomials Over Finite Fields
cites work: Q3481743
cites work: On Some Exponential Sums
DOI: 10.1007/S00037-012-0052-6
description: scientific article; zbMATH DE number 6212887