Choosing, agreeing, and eliminating in communication complexity
type: Item
instance of: scholarly article
title: Choosing, agreeing, and eliminating in communication complexity
zbMATH Open document ID: 1366.68050
author: Amos Beimel
author: Sebastian Ben Daniel
author: Eyal Kushilevitz
author: Enav Weinreb
published in: Computational Complexity
publication date: 2014-09-25T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6347790
zbMATH Keywords: communication complexity
zbMATH Keywords: direct sum
zbMATH Keywords: elimination
zbMATH Keywords: selection
MaRDI profile type: Publication
OpenAlex ID: W2039983178
cites work: Private vs. common random bits in communication complexity
cites work: The communication complexity of enumeration, elimination, and selection
cites work: Some connections between bounded query classes and non-uniform complexity.
cites work: An information statistics approach to data stream and communication complexity
cites work: How to compress interactive communication
cites work: A strong direct product theorem for corruption and the multiparty communication complexity of disjointness
cites work: Terse, superterse, and verbose sets
cites work: The complexity of ODDnA
cites work: Q4542529
cites work: Enumerative counting is hard
cites work: The Probabilistic Communication Complexity of Set Intersection
cites work: Communication complexity towards lower bounds on circuit depth
cites work: Amortized Communication Complexity
cites work: On the complexity of 2-output Boolean networks
cites work: Bounded queries in recursion theory
cites work: Theory of semi-feasible algorithms
cites work: Optimal direct sum results for deterministic and randomized decision tree complexity
cites work: Q4449184
cites work: Semirecursive Sets and Positive Reducibility
cites work: Fractional Covers and Communication Complexity
cites work: Super-logarithmic depth lower bounds via the direct sum in communication complexity
cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth
cites work: On self-reducibility and weak P-selectivity
cites work: A proof of Beigel's cardinality conjecture
cites work: Communication Complexity
cites work: Products and Help Bits in Decision Trees
cites work: Q4527004
cites work: Q4038696
cites work: P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
cites work: Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
cites work: Reductions on NP and p-selective sets
cites work: On membership comparable sets
cites work: On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
DOI: 10.1007/S00037-013-0075-7
description: scientific article; zbMATH DE number 6347790