NP complexity class/Related Articles

From Citizendium
< NP complexity class
Revision as of 19:16, 17 August 2010 by imported>Peter Schmitt (I do not think that it is useful to include these persons as "related". VD if he indeed solved it, the others as inline links if they occur in the article.)
Jump to navigation Jump to search
This article is developing and not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
https://en.citizendium.org/wiki/index.php?title=NP_complexity_class/Related_Articles&printable=yes
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

Retrieved from "https://citizendium.org/wiki/index.php?title=NP_complexity_class/Related_Articles&oldid=659286"