Abstract
The Orbit problem is defined as follows: Given a matrix A ∈ℚn×n and vectors x,y ∈ ℚn, does there exist a non-negative integer i such that A i x = y. This problem was shown to be in deterministic polynomial time by Kannan and Lipton in [7]. In this paper we put the problem in the logspace counting hierarchy GapLH. We also show that the problem is hard for C=L. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Arvind, V., & Vijayaraghavan, T. C. (2008). The orbit problem is in the GapL hierarchy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5092 LNCS, pp. 160–169). https://doi.org/10.1007/978-3-540-69733-6_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
