We analyze two popular semidefinite programming relaxations for quadratically constrained quadratic programs with matrix variables. These relaxations are based on vector lifting and on matrix lifting; ...

Input: a chain of matrices to be multiplied Output: a parenthesizing of the chain Objective: minimize number of steps needs for the multiplication Suppose that we want to multiply a sequence of ...