Jump to content

Yasaman KalantarMotamedi

New Members

  • Joined

  • Last visited

View Profile Find content
  1. Yasaman KalantarMotamedi

    P=NP Proof

    Yasaman KalantarMotamedi posted a topic in Computer Science
    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

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.