Algorithms Approaching the Threshold for Semirandom Planted Clique

Explore cutting-edge research in algorithmic theory with this 55-minute lecture from the EnCORE Workshop on Computational vs Statistical Gaps in Learning and Optimization. Delve into Princeton University researcher Pravesh Kothari's presentation on "Algorithms Approaching the Threshold for Semirandom Planted Clique," recorded at the Institute for Pure & Applied Mathematics (IPAM) at UCLA. Gain insights into advanced concepts in graph theory, randomized algorithms, and computational complexity as Kothari discusses recent developments in approaching theoretical thresholds for solving the planted clique problem in semirandom graphs. Enhance your understanding of the intersection between computer science and mathematics in this thought-provoking talk aimed at researchers, graduate students, and professionals in the field of theoretical computer science and applied mathematics.

Pravesh Kothari - Algorithms Approaching the Threshold for Semirandom Planted Clique - IPAM at UCLA