An Optimal Space Lower Bound 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=pIMh2n2kGkM


Duration: 44:55
766 views
3

Michael Kapralov (Ecole Polytechnique Federale de Lausanne)
https://simons.berkeley.edu/talks/approximating-cost-metric-k-nearest-neighbor-graph-sublinear-time
Sublinear Algorithms and Nearest-Neighbor Search



Other Videos By Simons Institute for the Theory of Computing


2018-11-30When Hashes Met Wedges - A Distributed Algorithm for Finding High Similarity Vectors
2018-11-29Efficient Reductions for k-Nearest Neighbor Search
2018-11-29Holder Homeomorphisms and Approximate Nearest Neighbors
2018-11-29Spectral Partitioning for Metrics (And NNs Too)
2018-11-29Fast NN Prediction with No Statistical Tradeoff
2018-11-29Online Algorithms for Low Rank Approximation
2018-11-29High Dimensional Robust Sparse Regression
2018-11-28Certified Sub-Linear Lower Bounds for K-Means Clustering
2018-11-28Monte Carlo Approximation Certificates for K-Means Clustering
2018-11-28Sublinear Algorithms for (Delta + 1) Vertex Coloring
2018-11-28An Optimal Space Lower Bound for Approximating MAX-CUT
2018-11-28Labeling a Data Set Using Sublinearly Many Queries
2018-11-28Importance Sampling in High Dimensions via Hashing
2018-11-28Learning-Augmented Sketches for Frequency Estimation
2018-11-27Sublinear Time Local-Access Random Generators
2018-11-27Erasures vs. Errors in Local Decoding and Property Testing
2018-11-27Testing and Learning Distributions Under Local Information Constraints
2018-11-27Universal Sketches
2018-11-27Adaptive Sparse Recovery with Limited Adaptivity
2018-11-26The Limits of Proof
2018-11-07Sketching Big Data


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Sublinear Algorithms and Nearest-Neighbor Search
Michael Kapralov