Vertex Sparsification for Edge Connectivity in Polynomial Time

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


Duration: 21:44
75 views
0

Authors: Yang P. Liu (Stanford University)
ITCS - Innovations in Theoretical Computer Science



Other Videos By Simons Institute for the Theory of Computing


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
2023-01-04Incompressiblity and Next-Block Pseudoentropy
2023-01-04Beeping Shortest Paths via Hypergraph Bipartite Decomposition
2023-01-04Unitary property testing lower bounds by polynomials
2023-01-04Quantum space, ground space traversal, and how to embed multi-prover...
2023-01-04Necessary Conditions in Multi-Server Differential Privacy
2023-01-04Making Decisions under Outcome Performativity


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