2000 character limit reached
On the Complexity of the Orbit Problem (1303.2981v3)
Published 12 Mar 2013 in cs.CC and cs.DS
Abstract: We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem---determining whether a target vector space V may be reached from a starting point x under repeated applications of a linear transformation A. Answering two questions posed by Kannan and Lipton in the 1980s, we show that when V has dimension one, this problem is solvable in polynomial time, and when V has dimension two or three, the problem is in NP{RP}.