Experimental results
-
This work is related to the experimental section of our paper which involves comaparison to Candes and Recht algorithm for matrix completion problem.
-
Here we compare the running time of existing convex relaxation based matrix completion methods (involving nuclear norm minimization) with our fixed-parameter-tractable (FPT) algorithms.
-
Assumptions
- Matrix entries are coming from GF(p), where p is a prime number.