Talk:Computational complexity theory: Difference between revisions

Content deleted Content added
SineBot (talk | contribs)
m Signing comment by J. Holden Caulfield - "P-NP not solvable?: new section"
No edit summary
Line 197:
 
The article does a poor job in failing to point out it is heavily biased towards [[worst-case analysis]]/[[worst-case complexity]] (and there are no articles explaining this concept). I threw in a phrase into the overview section, but someone has to make a prominent point on the issue in the article, since this is a fundamental concept. Probably a whole section about worst/case/average caes, upper/lower bounds, etc. Unfortunately I am not a man for the job. [[User:Twri|Twri]] ([[User talk:Twri|talk]]) 19:21, 24 February 2009 (UTC)
 
Also, the neutrality of this part of the article is disputable. Perhaps a revision is needed?
 
== OK done big edit ==