NP complexity class/Related Articles: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Meg Taylor
No edit summary
No edit summary
 
(One intermediate revision by one other user not shown)
Line 12: Line 12:
{{r|Stephen Cook}}
{{r|Stephen Cook}}
{{r|Richard Karp}}
{{r|Richard Karp}}
{{r|Vinay Deolalikar}}
==Articles related by keyphrases (Bot populated)==
{{r|Chinese Space Plane}}
{{r|Huey Long}}
{{r|Spanish missions in California}}
{{r|Ajax (web technology)}}

Latest revision as of 06:01, 23 September 2024

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
A list of Citizendium articles, and planned articles, about NP complexity class.
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

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]

Other related topics

Articles related by keyphrases (Bot populated)