Information complexity and applications.
type: Item
instance of: scholarly article
title: Information complexity and applications.
zbMATH Open document ID: 1417.68040
author: Mark Braverman
published in: Japanese Journal of Mathematics. 3rd Series
publication date: 2019-03-14T00:00:00Z
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 94A15
Mathematics Subject Classification ID: 94A24
Mathematics Subject Classification ID: 94A29
zbMATH DE Number: 7036347
zbMATH Keywords: communication complexity
zbMATH Keywords: information complexity
zbMATH Keywords: survey paper
MaRDI profile type: Publication
full work available at URL: s11537-018-1727-9
OpenAlex ID: W2915610068
cites work: An information statistics approach to data stream and communication complexity
cites work: How to compress interactive communication
cites work: Q4589018
cites work: Interactive Information Complexity
cites work: Public vs Private Coin in Bounded-Round Information
cites work: Small Value Parallel Repetition for General Games
cites work: From information to exact communication
cites work: Information Equals Amortized Communication
cites work: Information complexity is computable
cites work: A discrepancy lower bound for information complexity
cites work: An Interactive Information Odometer and Applications
cites work: Amortized Communication Complexity
cites work: Computing with Noisy Information
cites work: Exponential Separation of Information and Communication for Boolean Functions
cites work: Exponential separation of communication and external information
cites work: The Probabilistic Communication Complexity of Set Intersection
cites work: Super-logarithmic depth lower bounds via the direct sum in communication complexity
cites work: Communication Complexity
cites work: Interactive compression for product distributions
cites work: Lower Bounds in Communication Complexity
cites work: An introduction to Kolmogorov complexity and its applications
cites work: Some Results on Distributed Source Coding for Interactive Function Computation
cites work: The Infinite-Message Limit of Two-Terminal Interactive Source Coding
cites work: Private vs. common random bits in communication complexity
cites work: Q4252734
cites work: Parallel Repetition in Projection Games and a Concentration Bound
cites work: A Parallel Repetition Theorem
cites work: On the distributional complexity of disjointness
cites work: Communication lower bounds using directional derivatives
DOI: 10.1007/S11537-018-1727-9
description: scientific article; zbMATH DE number 7036347