Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

You're correct. They're claiming an algorithm to solve an NP hard problem in polynomial time.

I was thinking of "if this paper is a contribution to eventually proving/disproving P=NP...", but failed to express that.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: