We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

My favorite NP-complete problem!

13
 Cite
 Share
 Download
 Purchase
No logo availableConfreaks, LLC
 Dominus, Mark

Formal Metadata

Title
My favorite NP-complete problem!
Title of Series
Number of Parts
34
Author
License
CC Attribution - ShareAlike 3.0 Unported:
You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor and the work or content is shared also in adapted form only under the conditions of this
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
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.