Journal article
On the complexity of the orbit problem
- 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 NPRP.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Bibliographic Details
- Publisher:
- Association for Computing Machinery Publisher's website
- Journal:
- Journal of the ACM Journal website
- Volume:
- 63
- Issue:
- 3
- Pages:
- 23
- Publication date:
- 2016-08-12
- Acceptance date:
- 2016-06-06
- DOI:
- ISSN:
-
0004-5411 and 1557-735X
Item Description
- Keywords:
- Pubs id:
-
pubs:518720
- UUID:
-
uuid:a9ff7ec8-83ed-427c-8c5d-fb5012b2bc9b
- Local pid:
- pubs:518720
- Source identifiers:
-
518720
- Deposit date:
- 2016-08-11
Terms of use
- Copyright holder:
- Association for Computing Machinery
- Copyright date:
- 2016
- Notes:
- Copyright © 2016 ACM. This is the accepted manuscript version of the article. The final version is available online from ACM at: https://doi.org/10.1145/2857050
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record