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: | , , |
|---|---|
| 格式: | Journal article |
| 出版: |
Association for Computing Machinery
2016
|