NP-Complete Problems. CIT 596, Spring 2012. Problems that Cross the Line. What if a problem has: An exponential upper bound A polynomial lower bound We have only found exponential algorithms, so it appears to be intractable.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
CIT 596, Spring 2012
“NP-Complete” comes from:
There are more NP-Complete problems than provably intractable problems.
To get famous in a hurry, for any NP-Complete problem:
They’ll be naming buildings after you before you are dead!