CACM logo

This Article

ACM TechNews

The Explainer: P vs. NP

[article image]
Credit: MIT News

MIT News

November 5, 2009

The Clay Mathematics Institute has a standing offer of $1 million for anyone who is able to prove or disprove one of seven problems that have never been solved. One of those problems is P=NP. Essentially, P is a set of relatively easy problems, and NP is a set of what appear to be extremely hard problems, so P=NP implies that the apparently hard problems actually have relatively easy solutions. 

Post a comment...
Name: Anonymous

Signed and anonymous comments submitted to this site are moderated and will appear if they are relevant to the topic and not abusive. Your comment will appear with your username if you are signed into the site, and will be anonymous if you are not signed in. View our policy on comments

Tools For Readers

Bookmark and Share
Default Font Size Large Font Size X-Large Font Size Text Size

Related ACM Resources

Conferences:

Courses:

  • IPv6 Deployment - Examine common IPv6 deployment issues, such as multihoming, connecting to the IPv6 Internet, managing IPv6 services, and IPv6 troubleshooting strategies. Examine how to deploy IPv6 …
More About ACM Resources

About Communications | Join ACM External Link | Renew External Link | Subscribe External Link | Sign In | For Authors | For Advertisers External Link | Privacy | Site Map | Help | Contact Us | Mobile Site

Copyright © 2012 by the ACM. All rights reserved.

Back to Top