Jump to content

P == NP?

imatfaal
in Science News

Featured Replies

Vladimir Romanov has released source code for an algorithm which he claims can solve 3-SAT problems. The 3-SAT problem is NP-complete - and Romanov claims his algorithm will solve in polynomial time, this would prove that P==NP as all NP problems can be mapped within polynomial time to the satisfiability problem.

 

With such a seemingly easily falsifiable claim Romanov might be proved wrong quite quickly - for any with the maths and compsci skill here is Romanov's announcement and links to the source code and article - and for those who need a bit more background here is a link to a long slashdot ramble that has some good stuff in it

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

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.