Yasaman KalantarMotamedi

P vs NP is a fundamental Computer Science/Math problem that has remained unsolved for half a century. I have proposed a solution that proves P=NP. To do so, it is required to propose a polynomial algorithm for one of the NP-complete problems. I have proposed a polynomial time algorithm for Hamiltonian cycle problem. I appreciate if you have a look at my preprint and comment on it. The preprint can be found here: https://osf.io/2gskv