Content deleted Content added
Line 190:
:Bit complexity refers to a measure of time complexity where the only operations assumed to operate in constant time are operations that act on single bits. I personally think it should be discussed in another article that compares and contrasts it with models where log-sized words are the unit. I'm not sure what such an article would be called. [[User:Dcoetzee|Dcoetzee]] 21:27, 24 July 2008 (UTC)
::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)
| |||