YoVDO

Algorithms Approaching the Threshold for Semirandom Planted Clique

Offered By: Institute for Pure & Applied Mathematics (IPAM) via YouTube

Tags

Theoretical Computer Science Courses Graph Theory Courses Randomized Algorithms Courses Computational Complexity Courses Applied Mathematics Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Aplicaciones de la teoría de grafos a la vida real
Miríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer