Hamiltonian cycle in polynomial time (P=NP)
Hamiltonian cycle in polynomial time (P=NP)
Sanket kulkarni
Pune, India sanketkulpnp@gmail.com
Abstract
This paper presents polynomial time algorithm for Hamiltonian cycle problem. The proposed approach uses dynamic programming to reduce exponential states while giving optimal solution in O(N^6) time complexity which proves P=NP.
Download
or download free
[changelog]
Categories & Tags
Similar Downloads
No related download found!