Talk:NP complexity class

From Citizendium
Revision as of 23:45, 12 November 2007 by imported>Warren Schudy (New page: {{subpages}})
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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