The orbit problem in higher dimensions

DOI10.1145/2488608.2488728zbMath1293.68139OpenAlexW2031633647MaRDI QIDQ5495866

Ventsislav Chonev, Joël Ouaknine, James Worrell

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2488608.2488728

zbMATH Keywords

orbit problemmatrix powersSkolem's problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Linear transformations, semilinear transformations (15A04)

Related Items (8)

On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 ⋮ On generalized conjugacy and some related problems ⋮ What's decidable about discrete linear dynamical systems? ⋮ Continuous-time orbit problems are decidable in polynomial-time ⋮ On the Identity Problem for the Special Linear Group and the Heisenberg Group. ⋮ Unnamed Item ⋮ O-Minimal Invariants for Discrete-Time Dynamical Systems ⋮ Algebraic model checking for discrete linear dynamical systems

This page was built for publication: The orbit problem in higher dimensions