NP complexity class/Related Articles: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Housekeeping Bot
imported>Peter Schmitt
(replace bot-generated list)
Line 1: Line 1:
<noinclude>{{subpages}}</noinclude>
<noinclude>{{subpages}}</noinclude>


==Parent topics==
== Parent topics ==
 
{{r|Computational complexity theory}}
 
{{r|Algorithm}}
==Subtopics==
 
 
==Other related topics==
 
 
<!-- Remove the section below after copying links to the other sections. -->
==Bot-suggested topics==
Auto-populated based on [[Special:WhatLinksHere/NP complexity class]]. Needs checking by a human.


{{r|Computational complexity theory}}
== Subtopics ==
{{r|Random number}}
{{r|P-versus-NP problem}}


{{Bot-created_related_article_subpage}}
== Other related topics ==
<!-- Remove the section above after copying links to the other sections. -->
{{r|Millenium Prize Problems}}

Revision as of 08:27, 13 August 2010

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=659282"