P-versus-NP problem/Related Articles

See also changes related to P-versus-NP problem, or pages that link to P-versus-NP problem or to this page or whose text contains "P-versus-NP problem".

---

Parent topics

• P complexity class [r]: Add brief definition or description
• NP complexity class [r]: Class of decision problems that can be solved in nondeterministic polynomial time or, equivalently, can be checked in polynomial time. ^[e]

Other related topics

• Millennium Prize Problems [r]: Add brief definition or description
• Stephen Cook [r]: Add brief definition or description

Articles related by keyphrases (Bot populated)

• Twitter [r]: A popular microblogging service, allowing users to post status updates of up to 140 characters via the Internet, mobile phone or a wide variety of applications that use the API. ^[e]
• NP complexity class [r]: Class of decision problems that can be solved in nondeterministic polynomial time or, equivalently, can be checked in polynomial time. ^[e]