Revision as of 21:42, 26 July 2008 edit Dcoetzee (talk \| contribs) 37,529 edits →Bit complexity and asymptotic complexity ← Previous edit		Revision as of 14:47, 30 July 2008 edit undo Abdull (talk \| contribs) Extended confirmed users, Pending changes reviewers 6,856 edits →Bit complexity and asymptotic complexity Next edit →
Line 191: ::Thank you for your answer. I'd be great if there was an article about the topic you mentioned (because, for example, I cannot imagine what a ''log-sized word unit'' is yet). In the meantime, I stumbled upon another redirect, ''[[asymptotic complexity]]'' which defies definition. --[[User:Abdull\|Abdull]] ([[User talk:Abdull\|talk]]) 09:02, 25 July 2008 (UTC) :::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)

Talk:Computational complexity theory: Difference between revisions