Polynomial-time algorithm for the orbit problem
Journal of the ACM (JACM)
Why is Boolean complexity theory difficult?
Poceedings of the London Mathematical Society symposium on Boolean function complexity
Modern computer algebra
The complexity of matrix rank and feasible systems of linear equations
Computational Complexity
Uniform constant-depth threshold circuits for division and iterated multiplication
Journal of Computer and System Sciences - Complexity 2001
The complexity of the characteristic and the minimal polynomial
Theoretical Computer Science - Mathematical foundations of computer science
The Complexity of the Inertia and Some Closure Properties of GapL
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
The Orbit Problem Is in the GapL Hierarchy
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
The orbit problem in higher dimensions
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Monomials, multilinearity and identity testing in simple read-restricted circuits
Theoretical Computer Science
| Hi-index | 0.00 |
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 (J. ACM 33(4):808---821, 1986). In this paper we place the problem in the logspace counting hierarchy GapLH. We also show that the problem is hard for C=L with respect to logspace many-one reductions.