arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.0566cs.CC
收藏

再论轨道问题

Orbit Problem Revisited

Taolue Chen, Xiaoming Sun, Nengkun Yu

摘要:

在这封信中,我们重温{ \em轨道问题},这是在\cite{HAR69,SHA79,KL86}研究。在\cite{KL86}中,Kannan和Lipton证明了这个问题在多项式时间内是可判定的。本文研究了{ \em近似轨道问题},证明了该问题除了一种情况外是可判定的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑