Figure 8From: Reducing the worst case running times of a family of RNA and CFG problems, using Valiant’s approachAn exemplification of the vertical partition of BI, J(the entries of BI, Jare dotted). (a) The pre-condition requires that all values in B[I,J], [I,J], excluding BI, J, are computed, and B I, J = βI,(I,J)⊗ β (I,J),J(see Figure 7). (b) B I, J is partitioned vertically to B I , J 1 and B I , J 2 , where B I , J 1 is computed recursively. (c) The pre-condition for computing B I , J 2 is established, by updating B I , J 2 to be B I , J 2 ⊕ ( B I , L ⊗ B L , J 2 ) (in this example L = J1, since I ends before J1 starts). Then, B I , J 2 is computed recursively (not shown).Back to article page