Talk:Computational complexity theory: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Warren Schudy
No edit summary
imported>Warren Schudy
No edit summary
 
Line 2: Line 2:


--[[User:Warren Schudy|Warren Schudy]] 12:33, 18 November 2007 (CST) Shouldn't this be part of the math workgroup as well?
--[[User:Warren Schudy|Warren Schudy]] 12:33, 18 November 2007 (CST) Shouldn't this be part of the math workgroup as well?
--[[User:Warren Schudy|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.

Latest revision as of 17:18, 1 January 2008

This article is developing and not approved.
 Main Article
 Discussion
Definition [?]
 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:  Please add a brief definition or description.
Checklist and Archives
 Workgroup category:  Computers [Categories OK]
 Talk Archive:  none  English language variant:  British English
To do.

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 "https://citizendium.org/wiki/index.php?title=Talk:Computational_complexity_theory&oldid=25882"