Главная
Study mode:
on
1
Introduction
2
Presentation
3
Planted clique
4
Perspective
5
How did you get interested
6
Does this work
7
Machine Learning for Algorithms
8
Fixed Stochastic Model
9
Nature of Instances
10
Ideal Algorithms
11
NP completeness
12
Input complexity
13
Sample Complexity
14
Patterns
Description:
Engage in a thought-provoking panel discussion featuring leading experts in computer science and algorithms as they explore the concept of "Beyond Worst-Case Analysis." Moderated by Russell Impagliazzo from UCSD, the panel includes renowned researchers Ravi Kannan (Microsoft Research), Shang-Hua Teng (USC), Avrim Blum (TTIC), Santosh Vempala (Georgia Tech), and Piotr Indyk (MIT). Delve into topics such as planted clique, machine learning for algorithms, fixed stochastic models, nature of instances, ideal algorithms, NP-completeness, input complexity, sample complexity, and patterns. Gain valuable insights into the panelists' perspectives, their journey into this field, and the practical applications of beyond worst-case analysis. This 70-minute discussion, part of the Simons Institute 10th Anniversary Symposium, offers a comprehensive exploration of advanced algorithmic concepts and their implications in modern computer science.

Beyond Worst-Case Analysis - Panel Discussion

Simons Institute
Add to list
0:00 / 0:00