Revision as of 14:47, 30 July 2008 edit Abdull (talk \| contribs) Extended confirmed users, Pending changes reviewers 6,856 edits →Bit complexity and asymptotic complexity ← Previous edit		Revision as of 17:32, 31 July 2008 edit undo Dcoetzee (talk \| contribs) 37,529 edits →Bit complexity and asymptotic complexity Next edit →
Line 192: :::Good idea. For lack of a better name, I've created a new article called [[Context of computational complexity]] describing many factors that affect complexity analyses, including the bit/word complexity distinction. [[User:Dcoetzee\|Dcoetzee]] 21:42, 26 July 2008 (UTC) ::::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)

Talk:Computational complexity theory: Difference between revisions