Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

SODA
2016
ACM

favoriteEmaildiscussreport

62views Algorithms» more SODA 2016»

Communication Complexity of Permutation-Invariant Functions

8 years 11 days ago

Communication Complexity of Permutation-Invariant Functions

Download people.csail.mit.edu

Badih Ghazi, Pritish Kamath, Madhu Sudan

Real-time Traffic

Algorithms | SODA 2016 |

claim paper

Related Content

» Construction of very hard functions for multiparty communication complexity

» Quantum Entanglement and the Communication Complexity of the Inner Product Function

» Lower Bounds on the Randomized Communication Complexity of ReadOnce Functions

» The LinearArray Conjecture in Communication Complexity is False

» On Rank vs Communication Complexity

» Communication Complexity Towards Lower Bounds on Circuit Depth

» A new exponential separation between quantum and classical oneway communication complexity

» Property Testing Lower Bounds via Communication Complexity

» Multiparty Quantum Communication Complexity with Routed Messages

» New bounds on classical and quantum oneway communication complexity

Post Info
More Details (n/a)

Added	09 Apr 2016
Updated	09 Apr 2016
Type	Journal
Year	2016
Where	SODA
Authors	Badih Ghazi, Pritish Kamath, Madhu Sudan

Comments (0)