NP complexity class/Related Articles

From Citizendium, the Citizens' Compendium
Jump to: navigation, search
This article is developing and not approved.
Main Article
Talk
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