O'Reilly logo

Art of Computer Programming, Volume 4A, The: Combinatorial Algorithms, Part 1 by Donald E. Knuth

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

88. A given value of d contributes at most 6Imaget/dImage units of delay (for 2Imaget/dImage clusters). (Actually O(t) delay suffices, as observed by Omid Etesami, if we rearrange clusters having the same d, since those can each be done in ≤ 9 units.)

89. Suppose first that the new condition is ij while the old was i′ → j′, where i < j and i′ < j′ and there are no complemented ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required