Talk:Computational complexity theory
--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.