arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1303.2981cs.CCcs.DS
收藏

论轨道问题的复杂性

On the Complexity of the Orbit Problem

Ventsislav Chonev, Joël Ouaknine, James Worrell

摘要:

我们考虑Kannan和Lipton的轨道问题的高维版本-确定在重复应用线性变换A的情况下,是否可以从起点x到达目标向量空间V。本文讨论了Kannan和Lipton在20世纪80年代提出的两个问题,证明了当V的维数为1时,该问题在多项式时间内可解,而当V的维数为2或3时,该问题在NP^{RP}内可解.

英文摘要:

We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem---determining whether a target vector space V may be reached from a starting point x under repeated applications of a linear transformation A. Answering two questions posed by Kannan and Lipton in the 1980s, we show that when V has dimension one, this problem is solvable in polynomial time, and when V has dimension two or three, the problem is in NP^{RP}.

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

↑