Deterministic Polynomial Time Algorithms for Matrix Completion Problems

We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the resulting matrix rank. Matrix completion belongs to the fundamental problems in computational complexity with numerous important algorithmic applications, among others, in computing dynamic transitive closures or multicast network codings [HKM05, HKY06]. We design efficient deterministic algorithms for common generalizations of the results of Lov

• Type: Journal
• Year: 2010
• Where: SIAMCOMP
• Authors: Gábor Ivanyos, Marek Karpinski, Nitin Saxena
• Keywords: Algorithm, Matrix, Matrix Completion, SIAMCOMP 2010