Exponential Separation of Information and Communication for Boolean Functions

DOI10.1145/2746539.2746572MaRDI QIDQ5892102zbMATH OpenOpenAlexFDO

Authors Anat Ganor, Gillat Kol, Ran Raz

Publication date 21 August 2015

Published in Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2746539.2746572

zbMATH Keywords

amortized communication complexitycommunication complexitycommunication compressiondirect suminformation complexity

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Exponential separation of information and communication for Boolean functions
• Exponential separation of quantum and classical communication complexity
• Nondeterministic communication complexity of random Boolean functions (extended abstract)
• Exponential separation of quantum communication and classical information
• Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
• Exponential separations for one-way quantum communication complexity, with applications to cryptography
• Exponential separation of quantum and classical one-way communication complexity
• Exponential Separation of Quantum and Classical One-Way Communication Complexity
• Boolean Functions: Noise Stability, Non-Interactive Correlation Distillation, and Mutual Information
• CommentsComments on “Canalizing Boolean Functions Maximize Mutual Information”

Cites work

• Approximate distance oracles
• Approximate distance oracles with constant query time
• Automata, Languages and Programming
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Fast C-K-R partitions of sparse graphs
• Near-Linear Time Construction of Sparse Neighborhood Covers
• On approximate distance labels and routing schemes with affine stretch
• On sparse spanners of weighted graphs
• Ramsey partitions and proximity data structures
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• Shortest-path queries in static networks

Cited in

(14)

• Information complexity and applications.
• Approximate nonnegative rank is equivalent to the smooth rectangle bound
• Canalizing Boolean Functions Maximize Mutual Information
• Relative discrepancy does not separate information and communication complexity
• Interactive Information Complexity
• Interactive information complexity
• Simplified separation of information and communication
• Relative discrepancy does not separate information and communication complexity
• Exponential separation of communication and external information
• Information lower bounds via self-reducibility
• On the Communication Complexity of Key-Agreement Protocols.
• Exponential separation of communication and external information
• Exponential separation of information and communication for Boolean functions
• Communication memento: memoryless communication complexity

Describes a project that uses

Uses Software

• Graphs

This page was built for publication: Exponential Separation of Information and Communication for Boolean Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892102)