Talk:Computational complexity theory

From Citizendium, the Citizens' Compendium
Jump to: navigation, search
This article is basically copied from an external source and has not been approved.
Main Article
Talk
Definition [?]
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to fill out this checklist, please see CZ:The Article Checklist. To update this checklist edit the metadata template.
 Definition Please add a brief definition or description.
To do.


  • A variant of English needs to be assigned.
Metadata here


--Warren Schudy 12:33, 18 November 2007 (CST) Shouldn't this be part of the math workgroup as well?

--Warren Schudy 17:18, 1 January 2008 (CST) The section on intractability needs a lot of work. Are we defining intractability to mean not polynomial, or to mean not practical? They usually overlap, but many NP-hard problems, such as knapsack, are solvable in practice, so we should be clear what the definition is.