Author:
Chen Taolue,Yu Nengkun,Han Tingting
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference9 articles.
1. The orbit problem is in the GapL hierarchy;Arvind,2008
2. Transcendental Number Theory;Baker,1990
3. The continuous Skolem–Pisot problem;Bell;Theor. Comput. Sci.,2010
4. Computing Jordan normal forms exactly for commuting matrices in polynomial time;Cai;Int. J. Found. Comput. Sci.,1994
5. The orbit problem in higher dimensions;Chonev,2013
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Explicit Bounds for Linear Forms in the Exponentials of Algebraic Numbers;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04
2. On the decidability of reachability in continuous time linear time-invariant systems;Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control;2021-05-19
3. A Necessary Condition on Chain Reachable Robustness of Dynamical Systems;IFAC-PapersOnLine;2020
4. On the Decidability of Membership in Matrix-exponential Semigroups;Journal of the ACM;2019-06-30
5. Solvability of Matrix-Exponential Equations;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05