Finding Large Cliques in Random and Semi-Random Graphs

Channel:

Subscribers:

68,700

Published on November 2, 2021 12:11:18 PM ● Video Link: https://www.youtube.com/watch?v=IjDv5M82KIw

Duration: 1:00:26

1,129 views

Uriel Feige (Weizmann Institute of Science)
https://simons.berkeley.edu/events/rmklectures2021-fall-4
Richard M. Karp Distinguished Lecture

Other Videos By Simons Institute for the Theory of Computing

2021-11-06	Function Space View Of Bounded Weight Norm Networks
2021-11-05	The Planted Matching Problem: Sharp Threshold And Infinite-Order Phase Transition
2021-11-05	Scalable And Reliable Inference For Probabilistic Modeling
2021-11-04	Learning and Optimization with Adaptive Smoothed Adversaries
2021-11-04	The Surprising Power Of The Lenstra-Lenstra-Lovasz Algorithm For Noiseless Inference
2021-11-03	Yes, Generative Models Are The New Sparsity
2021-11-03	Panel on Novel Fault-Tolerant Qubits \| Quantum Colloquium
2021-11-03	On the Power of Differentiable Learning
2021-11-03	Simple Architecture for a Fault-Tolerant Qubit \| Quantum Colloquium
2021-11-02	A Data-Centric View On Robustness
2021-11-02	Finding Large Cliques in Random and Semi-Random Graphs
2021-10-30	Density Control of Interacting Agent Systems
2021-10-30	Discrete-To-Continuum Limits of Dynamical Optimal Transport Problems
2021-10-30	Learning Interaction Kernels in Stochastic Systems of...
2021-10-30	Mirror Descent Algorithms for Minimizing Interacting Free Energy
2021-10-30	How to Train Better: Exploiting the Separability of DNNs
2021-10-29	A Particle Method for Degenerate Diffusion, and Applications to Robotic Swarming
2021-10-29	Deterministic Particle Approximation for Nonlocal Transport Equations
2021-10-29	Extending the JKO Scheme Beyond Wasserstein-2 Gradient Flows
2021-10-29	Sampling From Wasserstein Barycenter
2021-10-29	Consensus Based Sampling

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Uriel Feige

Richard M. Karp Distinguished Lecture