Hacker News new | ask | show | jobs
Hamiltonian Cycle Problem is in P (arxiv.org)
3 points by mau 1855 days ago
1 comments

Not very likely that this is correct, because the problem is know to be NP-complete https://en.wikipedia.org/wiki/Hamiltonian_path_problem and this seems to imply that NP=P. And that is what the author claims in the conclusion!