HN
Hacker News
Top
New
Best
Ask
Show
Jobs
Comment by ensconced | Hacker News Reader
Full thread
ensconced
·
Does this apply to the discrete Knapsack problem too?
View on HN
chaoxu
·
It does not. For faster pseudopolynomial time algorithms to knapsack, see this
https://arxiv.org/abs/1802.06440
Reply on news.ycombinator.com