The NOF multiparty communication complexity of composed functions
type: Item
instance of: scholarly article
title: The NOF multiparty communication complexity of composed functions
zbMATH Open document ID: 1329.68103
author: Yong-Cai Geng
author: Sumit K. Garg
published in: Computational Complexity
publication date: 2015-09-21T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05D10
zbMATH DE Number: 6483858
zbMATH Keywords: number on the forehead model
zbMATH Keywords: communication complexity
zbMATH Keywords: Ramsey theory
Wikidata QID: Q62556715
MaRDI profile type: Publication
full work available at URL: s00037-013-0078-4
OpenAlex ID: W2081819660
cites work: The space complexity of approximating the frequency moments
cites work: Communication Complexity of Simultaneous Messages
cites work: Simultaneous messages vs. communication
cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
cites work: New bounds on cap sets
cites work: Q3002822
cites work: Multiparty Communication Complexity and Threshold Circuit Size of AC^0
cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
cites work: The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
cites work: On ACC
cites work: Property testing lower bounds via communication complexity
cites work: On triples in arithmetic progression
cites work: An ergodic Szemerédi theorem for commuting transformations
cites work: Q3568106
cites work: Disjointness is hard in the multiparty number-on-the-forehead model
cites work: Languages with Bounded Multiparty Communication Complexity
cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
cites work: Communication Complexity and Quasi Randomness
cites work: Complexity of constructing solutions in the core based on synergies among coalitions
cites work: An improved construction of progression-free sets
cites work: Q4474216
cites work: Hypergraph regularity and the multidimensional Szemerédi theorem
cites work: Decompositions, approximate structure, transference, and the Hahn-Banach theorem
cites work: Q3416242
cites work: The BNS lower bound for multi-party protocols is nearly optimal
cites work: Q4230350
cites work: Circuits and multi-party protocols
cites work: On the power of small-depth threshold circuits
cites work: Lower bounds and separations for constant depth multilinear circuits
cites work: Communication Complexity
cites work: Q5298130
cites work: Lower bounds for local versions of dimension reductions
cites work: On data structures and asymmetric communication complexity
cites work: Q5414575
cites work: Q4284623
cites work: Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
cites work: Rounds in Communication Complexity Revisited
cites work: Sets of integers that do not contain long arithmetic progressions
cites work: Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
cites work: An Application of Hindman's Theorem to a Problem on Communication Complexity
cites work: Fourier analysis for probabilistic communication complexity
cites work: The BNS-Chung criterion for multi-party communication complexity
cites work: Quantum communication complexity of symmetric predicates
cites work: On Certain Sets of Integers
cites work: On Roth's theorem on progressions
cites work: Q3549688
cites work: The multiparty communication complexity of set disjointness
cites work: Q3636247
cites work: Q3633949
cites work: ON A GENERALIZATION OF SZEMERÉDI'S THEOREM
cites work: On a problem of Gowers
cites work: Q5301801
cites work: Q3002796
DOI: 10.1007/S00037-013-0078-4
description: scientific article; zbMATH DE number 6483858