Algorithms Approaching the Threshold for Semirandom Planted Clique
Offered By: Institute for Pure & Applied Mathematics (IPAM) via YouTube
Course Description
Overview
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.
Syllabus
Pravesh Kothari - Algorithms Approaching the Threshold for Semirandom Planted Clique - IPAM at UCLA
Taught by
Institute for Pure & Applied Mathematics (IPAM)
Related Courses
Introduction to Dynamical Systems and ChaosSanta Fe Institute via Complexity Explorer Introduction to Engineering Mathematics with Applications
University of Texas Arlington via edX A-level Mathematics for Year 12 - Course 1: Algebraic Methods, Graphs and Applied Mathematics Methods
Imperial College London via edX Introduction to Methods of Applied Mathematics
Indian Institute of Technology Delhi via Swayam Master’s Degree in Mechanical Engineering
Purdue University via edX