Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic - P versus NP problem - Document - PDFSEARCH.IO

First Page	Meta Content
	Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic Add to Reading List Document Date: 2011-10-24 15:11:43 Open Document File Size: 445,12 KB Share Result on Facebook Currency EUR / / / IndustryTerm greedy∗ algorithm / polynomial algorithm / exponential algorithms / polynomial algorithms / algorithmic solutions / / Person Juraj Hromkovi / Tom Verhoeff / / Position Salesman / Traveling Salesman / / ProgrammingLanguage TSP / C / / ProvinceOrState New Brunswick / / Technology greedy∗ algorithm / polynomial algorithms / slow Slow algorithms / polynomial algorithm / / SocialTag Complexity classes Dynamic programming NP-complete problems Operations research P versus NP problem Time complexity Knapsack problem P Subset sum problem Theoretical computer science

Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to MagicAdd to Reading List