Conference item
The orbit problem in higher dimensions
- 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. Copyright 2013 ACM.
Actions
Authors
Bibliographic Details
- Pages:
- 941-949
- Host title:
- Proceedings of the Annual ACM Symposium on Theory of Computing
- Publication date:
- 2013-01-01
- DOI:
- ISSN:
-
0737-8017
- Source identifiers:
-
411580
- ISBN:
- 9781450320290
Item Description
- Keywords:
- Pubs id:
-
pubs:411580
- UUID:
-
uuid:ce170ce7-86a5-45f3-ae96-2a1b32200770
- Local pid:
- pubs:411580
- Deposit date:
- 2013-11-17
Terms of use
- Copyright date:
- 2013
If you are the owner of this record, you can report an update to it here: Report update to this record