Streaming Lower Bounds for Approximating MAX-CUT

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=eXHBiUutG5o


Duration: 30:08
312 views
1

Michael Kapralov, IBM T.J. Watson Research Center
Information Theory in Complexity Theory and Combinatorics
http://simons.berkeley.edu/talks/michael-kapralov-2015-04-20



Other Videos By Simons Institute for the Theory of Computing


2015-04-28Some Novel Computational Models to Think About
2015-04-28Tutorial on List Decodable Coding Schemes and Interactive Communication in Networks (Part 2 of 2)
2015-04-28Deterministic Communication vs. Partition Number
2015-04-28Information Theory and Additive Combinatorics
2015-04-28Non-Signalling Parallel Repetition Using de Finetti Reductions
2015-04-28Limits to Efficient Preprocessing
2015-04-27Parallel Repetition for Entangled Games via Fast Quantum Search
2015-04-27Lucky Talk: A Communication Game Approach to the Sensitivity Conjecture
2015-04-27Streaming Interactive Proofs and Arthur-Merlin Communication
2015-04-27Counting Distinct Elements in the Message Passing Model
2015-04-27Streaming Lower Bounds for Approximating MAX-CUT
2015-04-27Welfare Maximization with Limited Interaction: Information and Communication in Economics
2015-04-27Information Complexity for Multi-Party NIH Communication
2015-04-27Lucky Talk: Exponential Separation of Information and Communication
2015-04-27Extended Formulations and Information Complexity
2015-04-27Relative Discrepancy Does Not Separate Information and Communication Complexity
2015-04-27A New Look at Gallager's Bounds
2015-04-27Information Complexity is Computable
2015-04-27On Parallelizing Streaming Algorithms
2015-04-27Combinatorial Proofs of Concentration Bounds
2015-04-27On Geometric Measures for Information Complexity


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Information Theory
Michael Kapralov