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...
主要な著者: | Chonev, V, Ouaknine, J, Worrell, J |
---|---|
フォーマット: | Journal article |
出版事項: |
Association for Computing Machinery
2016
|
類似資料
-
On the complexity of the orbit problem
著者:: Chonev, V, 等
出版事項: (2016) -
The orbit problem in higher dimensions
著者:: Chonev, V, 等
出版事項: (2013) -
On the skolem problem for continuous linear dynamical systems
著者:: Chonev, V, 等
出版事項: (2016) -
On the Skolem Problem for continuous linear dynamical systems
著者:: Ouaknine, J, 等
出版事項: (2016) -
The Semialgebraic Orbit Problem
著者:: Almagor, S, 等
出版事項: (2019)