Yasaman KalantarMotamedi Posted January 4, 2022 Share Posted January 4, 2022 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 Link to comment Share on other sites More sharing options...
swansont Posted January 4, 2022 Share Posted January 4, 2022 ! Moderator Note The rules require that you post information here for discussion; the discussion can't rely on outside links Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now