'Smoothed analysis' presentation slideshows

Rigorous analysis of heuristics for NP-hard problems

Rigorous analysis of heuristics for NP-hard problems. Uriel Feige Weizmann Institute Microsoft Research. Computational problems. We would love to have algorithms that: Produce optimal results. Are efficient (polynomial time). Work on every input instance. NP-hardness.

641 views • 48 slides

Learning and smoothed analysis

495 views • 37 slides

Basic Principles of Behavior of Algorithms - Edukite

This course is a study of Behavior of Algorithms and covers an area of current interest in theoretical computer science. The topics vary from term to term. During this term, we discuss rigorous approaches to explaining the typical performance of algorithms with a focus on the following approaches smoothed analysis. In addition to that, condition numbers/parametric analysis, and subclassing inputs will be discussed. See More: https://bit.ly/2YCSkdn

119 views • 9 slides