Orbit Problem Revisited
Computational Complexity
2013-09-20 v2
Abstract
In this letter, we revisit the {\em orbit problem}, which was studied in \cite{HAR69,SHA79,KL86}. In \cite{KL86}, Kannan and Lipton proved that this problem is decidable in polynomial time. In this paper, we study the {\em approximate orbit problem}, and show that this problem is decidable except for one case.
Cite
@article{arxiv.1302.0566,
title = {Orbit Problem Revisited},
author = {Taolue Chen and Xiaoming Sun and Nengkun Yu},
journal= {arXiv preprint arXiv:1302.0566},
year = {2013}
}
Comments
Comments are welcome. We delete the first part since the overlap with arxiv:1303.2981 by other authors