2000 character limit reached
Matrix Completion and Tensor Rank (1302.2639v2)
Published 11 Feb 2013 in math.OC, math.ST, and stat.TH
Abstract: In this paper, we show that the low rank matrix completion problem can be reduced to the problem of finding the rank of a certain tensor.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.