NP complexity class/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Daniel Mietchen |
imported>Daniel Mietchen |
||
| Line 10: | Line 10: | ||
== Other related topics == | == Other related topics == | ||
{{r|Millenium Prize Problems}} | {{r|Millenium Prize Problems}} | ||
{{r| | {{r|Stephen Cook}} | ||
{{r|Richard Karp}} | {{r|Richard Karp}} | ||
{{r|Vinay Deolalikar}} | {{r|Vinay Deolalikar}} | ||
Revision as of 15:06, 17 August 2010
- See also changes related to NP complexity class, or pages that link to NP complexity class or to this page or whose text contains "NP complexity class".
Parent topics
- Computational complexity theory [r]: Add brief definition or description
- Algorithm [r]: A sequence of steps used to solve a problem. [e]
Subtopics
- P-versus-NP problem [r]: A famous open problem in complexity theory asking whether any decision problem that can be solved by a nondeterministic algorithm in polynomial time can also be solved deterministically in polynomial time. [e]