4 ms·
"As a well-known problem in NPC, the Hamiltonian Cycle Problem can be now resolved practically in deterministic polynomial time, so this problem is in P and we
by thanatos519 5y ago
"As a well-known problem in NPC, the Hamiltonian Cycle Problem can be now resolved practically in deterministic polynomial time, so this problem is in P and we prove that the conjecture of P=NP holds."
I'm skeptical, but the paper is short ...
- HelloNurse 5y agoShort but messy. I suspect either that the algorithm doesn't actually work or that some worse than polynomial space or time cost hides in the numerous steps and subalgorithms.