P-versus-NP problem/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Meg Taylor No edit summary |
Pat Palmer (talk | contribs) mNo edit summary |
||
| Line 11: | Line 11: | ||
{{r|Millennium Prize Problems}} | {{r|Millennium Prize Problems}} | ||
{{r|Stephen Cook}} | {{r|Stephen Cook}} | ||
Revision as of 12:25, 20 February 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]