Orbit Problem Revisited
Abstract
In this letter, we revisit the orbit problem, which was studied in HAR69,SHA79,KL86. In KL86, Kannan and Lipton proved that this problem is decidable in polynomial time. In this paper, we study the approximate orbit problem, and show that this problem is decidable except for one case.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.