![Complexity classes / Dynamic programming / NP-complete problems / Operations research / P versus NP problem / Time complexity / Knapsack problem / P / Subset sum problem / Theoretical computer science / Computational complexity theory / Applied mathematics Complexity classes / Dynamic programming / NP-complete problems / Operations research / P versus NP problem / Time complexity / Knapsack problem / P / Subset sum problem / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/89eb5c877e66c66653ac0548aad9c1e5.jpg)
| Document Date: 2011-10-24 15:11:43 Open Document File Size: 445,12 KBShare 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 |