On the complexity of the orbit problem

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...

תיאור מלא

מידע ביבליוגרפי
Main Authors: Chonev, V, Ouaknine, J, Worrell, J
פורמט: Journal article
יצא לאור: Association for Computing Machinery 2016
Search Result 1

On the complexity of the orbit problem מאת Chonev, V, Ouaknine, J, Worrell, J

יצא לאור 2016
Journal article