[1]}
Let M be an \(n_1 \times n_2\)  sized matrix of rank r.
Then the convex optimization problem that is defined above could successfully recover the underlying matrix, whenever \(| \Omega | > C n^{6/5} r \log {n}\)   where  \(n = \mathrm {max}(n_1, n_2)\)
