Talking head
!!Con 2016

This presentation, by Mark Dominus, is licensed under a Creative Commons Attribution ShareAlike 3.0

NP-complete problems are the hardest problems whose solutions can be efficiently checked for correctness. An efficient method of solving any NP-complete problem would translate directly into efficient solutions for all of them. Many famous and interesting problems are NP-complete, but this is not one of them! This is the problem of how to distribute “Elmo’s World” segments onto a series of video releases. Nobody knows a good way to solve NP-complete problems. The Elmo’s World people were not able to solve their problem either.

Rated: Everyone
Viewed 188 times
Tags: There are no tags for this video.