We are creating the world's most trusted encyclopedia and knowledge base.
Once you join us and log in, you'll be able to edit this page instantly!

Talk:Computational complexity theory

From Citizendium, the Citizens' Compendium

Jump to: navigation, search

Image:Statusbar4.png
Main Article
Talk
Definition [?]
Related Articles  [?]
Bibliography  [?]
External Links  [?]
 
To learn how to fill out this checklist, please see CZ:The Article Checklist. To update this checklist edit the metadata template.
Move Cluster
Checklist and Archives
 Definition:  Please add a brief definition or description.
 Workgroup category:  Computers Workgroup [Categories OK]
 Article status:  External article (from another source, with little change)
 English language variant:  Not specified  Underlinked article?:  No
 Talk Archive:  none (to start Archive 1)
To do.

Please write a brief definition or description of this article at Computational complexity theory/Definition

  • A language variant 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.

Retrieved from "http://locke.citizendium.org:8080/wiki/Talk:Computational_complexity_theory"
Views
Personal tools