HN
Hacker News
Top
New
Best
Ask
Show
Jobs
Comment by chaoxu | Hacker News Reader
Parent
Full thread
chaoxu
·
0-1 knapsack is not known to be solvable in polynomial time.
View on HN
howling
·
Okay, to be pedantic, pseudo-polynomial time.
Reply on news.ycombinator.com