Beyond Worst-Case Analysis (Lecture 15: Smoothed Complexity and Pseudopolynomial-Time Algorithms)

preview_player
Показать описание
For binary optimization problems, polynomial smoothed complexity implies and is implied by (Las Vegas randomized) pseudopolynomial worst-case complexity.
Рекомендации по теме
Комментарии
Автор

This video definitely not a really in depth Science about the Boundary Waters Canoe Area at all :)

troykohlhorst