Revision as of 14:44, 9 June 2021 edit Werediver (talk \| contribs) 3 edits →Bit complexity and asymptotic complexity Tag: 2017 wikitext editor ← Previous edit		Revision as of 14:58, 9 June 2021 edit undo D.Lazard (talk \| contribs) Extended confirmed users 35,609 edits →Bit complexity and asymptotic complexity: redirect fixed Next edit →
Line 195: :::::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) ::::::: Now, {{noredirect\|Asymptotic complexity}} is a redirect to [[Computational complexity#Asymptotic complexity]]. [[User:D.Lazard\|D.Lazard]] ([[User talk:D.Lazard\|talk]]) 14:58, 9 June 2021 (UTC) == worst-case analysis ==

Talk:Computational complexity theory: Difference between revisions