Rounding via Low Dimensional Embeddings

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


Duration: 26:34
122 views
3

Authors: Mark Braverman (Princeton University); Dor Minzer (MIT)
ITCS - Innovations in Theoretical Computer Science



Other Videos By Simons Institute for the Theory of Computing


2023-01-04Is Untrusted Randomness Helpful?
2023-01-04Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique
2023-01-04Making Auctions Robust to Aftermarkets
2023-01-04Asynchronous Multi-Party Quantum Computation
2023-01-04Decision Making under Miscalibration - 8 minute
2023-01-04Decision Making under Miscalibration
2023-01-04Epic Fail: Emulators can tolerate some edge faults for free
2023-01-04Karchmer-Wigderson Games for Hazard-free Computation
2023-01-04A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators
2023-01-04Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
2023-01-04Rounding via Low Dimensional Embeddings
2023-01-04Efficient algorithms for certifying lower bounds on the discrepancy of random matrices
2023-01-04Unsplittable Euclidean Capacitated Vehicle Routing: A 2+\epsilon)(2+ϵ)-Approximation Algorithm
2023-01-04Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses
2023-01-04On the computational hardness needed for quantum cryptography
2023-01-04Kolmogorov Complexity Characterizes Statistical Zero Knowledge
2023-01-04Vertex Sparsification for Edge Connectivity in Polynomial Time
2023-01-04Extremal Combinatorics, iterated pigeonhole arguments, and generalizations of PPP
2023-01-04Fractional certificates for bounded functions
2023-01-04Expander Decomposition in Dynamic Streams
2023-01-04PPP-Completeness and Extremal Combinatorics


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
ITCS - Innovations in Theoretical Computer Science