On the Complexity of Robust PCA and l1-Norm Low-Rank Matrix Approximation