论文信息 - Continuous-time orbit problems are decidable in polynomial-time

Continuous-time orbit problems are decidable in polynomial-time

We place the continuous-time orbit problem in P , sharpening the decidability result shown by Hainry 7. We revisit the continuous-time orbit problem studied by Hainry;We simplify the argument given by Hainry, providing a new algorithm for the problem;We perform complexity analysis based on the new algorithm and place the problem in P .

Taolue Chen | Tingting Han | Nengkun Yu

[1] Emmanuel Hainry,et al. Reachability in Linear Dynamical Systems , 2008, CiE.

[2] Joël Ouaknine,et al. The orbit problem in higher dimensions , 2013, STOC '13.

[3] Jin-Yi Cai,et al. Computing Jordan Normal Forms Exactly for Commuting Matrices in Polynomial Time , 1994, Int. J. Found. Comput. Sci..

[4] Jean-Charles Delvenne,et al. The continuous Skolem-Pisot problem , 2010, Theor. Comput. Sci..

[5] Richard J. Lipton,et al. Polynomial-time algorithm for the orbit problem , 1986, JACM.

[6] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[7] Joël Ouaknine,et al. Positivity Problems for Low-Order Linear Recurrence Sequences , 2013, SODA.

[8] A. Baker. Transcendental Number Theory , 1975 .

[9] Vikraman Arvind,et al. The orbit problem is in the GapL hierarchy , 2008, J. Comb. Optim..