Talk:Computational complexity theory: Difference between revisions

Content deleted Content added
No edit summary
Twri (talk | contribs)
Line 193:
::::Thank you very much! Now, only ''asymptotic complexity'' has to be explained (please! :). --[[User:Abdull|Abdull]] ([[User talk:Abdull|talk]]) 14:47, 30 July 2008 (UTC)
:::::That's just a bad redirect. :-) Asymptotic complexity is nothing but complexity metrics described using asymptotic notation. For now I redirected it to [[Big O notation]]. [[User:Dcoetzee|Dcoetzee]] 17:32, 31 July 2008 (UTC)
 
== worst-case analysis ==
 
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)