P-versus-NP problem/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Peter Schmitt (new) |
No edit summary |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 9: | Line 9: | ||
==Other related topics== | ==Other related topics== | ||
{{r| | {{r|Millennium Prize Problems}} | ||
{{r|Stephen Cook}} | {{r|Stephen Cook}} | ||
{{r| | ==Articles related by keyphrases (Bot populated)== | ||
{{r|Twitter}} | |||
{{r|NP complexity class}} | |||
Latest revision as of 11:01, 30 September 2024
- 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]
Subtopics
- Millennium Prize Problems [r]: Add brief definition or description
- Stephen Cook [r]: Add brief definition or description
- 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]