Talk:NP complexity class

From Citizendium
Revision as of 12:41, 13 November 2007 by imported>Aleksander Stos (re)
Jump to navigation Jump to search
This article is developing and not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition:  Class of decision problems that can be solved in nondeterministic polynomial time or, equivalently, can be checked in polynomial time. [d] [e]
Checklist and Archives
 Workgroup categories:  Mathematics and Computers [Please add or review categories]
 Talk Archive:  none  English language variant:  British English

--Warren Schudy 23:55, 12 November 2007 (CST) Why does the subpages template produce that green notice about seeking approval? This article is far from that point!

Don't worry, just a placeholder :) Aleksander Stos 12:41, 13 November 2007 (CST)
Retrieved from "https://citizendium.org/wiki/index.php?title=Talk:NP_complexity_class&oldid=334210"