Revision as of 16:32, 9 January 2020 edit SineBot (talk \| contribs) Bots 2,564,662 edits m Signing comment by Shalevku - "→The quantitative answer?: new section" ← Previous edit		Revision as of 14:44, 9 June 2021 edit undo Werediver (talk \| contribs) 3 edits →Bit complexity and asymptotic complexity Tag: 2017 wikitext editor Next edit →
Line 194: ::::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) :::::: [[Asymptotic complexity]] now redirects here again. This article is good, but it doesn't contain the word "asymptotic" at all. The [[Big O notation]] might be a better redirect. [[User:Werediver\|Werediver]] ([[User talk:Werediver\|talk]]) 14:44, 9 June 2021 (UTC) == worst-case analysis ==

Talk:Computational complexity theory: Difference between revisions