Jump to content
  • Advertisement
Sign in to follow this  
widggman

NP = P

This topic is 4625 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

I'm currently studying for my exam in my course of algorithm. And I was asking myself, what will happen if a problem NP (or NP-Complete) can be resolve now in polynomial time ?? What will be the value of a such algorithm (educational, money, ...) ?? Many program using the ancien NP algorithm will have to be adapt in to the P algorithm... I would like to read your answer on that, and if there is already a thread on this... sorry!

Share this post


Link to post
Share on other sites
Advertisement
I don't have the link, but I believe the Chicago Art Institute is the place that is offering a $million for a proof of NP = P or NP != P. Some stipulations are that you have to publish your proof in a known math journal and they will pay the money after a year of no one disproving it.

Something like that. Cheers.

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

GameDev.net is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.

Sign me up!