Jump to content

porton

Members

  • Joined

  • Last visited

View Profile Find content

Everything posted by porton

  1. porton

    I have an NP-complete algorithm, under the assumption that P=NP

    porton posted a topic in Computer Science
    I claim to have proved that my algorithm is NP-complete under the assumption that P=NP. https://math.portonvictor.org/2021/04/08/my-algorithm-that-is-np-complete-in-the-case-if-pnp/ Please, check my proof for errors (3 pages PDF file with the proof itself fitting in 1 page). That's the third revision of my algorithm. The first two were erroneous. This is my first math research work outside of general topology (and some logic/CS stuff far from complexity theory). I did it in about two days. I don't know how to break BitCoin, surely my algorithm is slow. BTW, which prizes to expect?

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.