Hacker News
new
top
best
ask
show
job
Settling Poker Debts is NP-hard
(
www.param.me
)
2 points
by
xparamt
5 hours ago
1 comment
hypnotic-hippo
5 hours ago
Since the Partition Problem is only weakly NP-complete, you could actually solve this in pseudo-polynomial time