Figure 11From: Reducing the worst case running times of a family of RNA and CFG problems, using Valiant’s approachThe base case of the Outside VMT algorithm. (a) An illustration of the matrix A upon computing Ai, j. (b) An illustration of the pre-computed matrix β. All required values of the form αi', j'for computing αi, jhave already been computed in the sub-matrix A[0,i], [j,n], excluding the entry Ai, jitself. μi, jis obtained either by the multiplication (β[0,i),i)T ⊗ A[0,i), j(the multiplication of the transposed striped dark gray vector in β with the striped dark gray vector in A), or by the multiplication Ai,(j, n]⊗ (βj,(j, n])T (the multiplication of the non-striped dark gray vector in A with the transposed non-striped dark gray vector in β).Back to article page