Continuous-time orbit problems are decidable in polynomial-time

被引：5
|
作者：
Chen, Taolue [1 ]
Yu, Nengkun [3 ,4 ]
Han, Tingting [2 ]
机构：
[1] Middlesex Univ, Dept Comp Sci, London N17 8HR, England
[2] Univ London, Dept Comp Sci & Informat Syst, London WC1E 7HU, England
[3] Univ Waterloo, Inst Quantum Comp, Waterloo, ON N2L 3G1, Canada
[4] Univ Guelph, Dept Math & Stat, Guelph, ON N1G 2W1, Canada
来源：
INFORMATION PROCESSING LETTERS | 2015年 / 115卷 / 01期
关键词：
Dynamical systems; Differential equation; Computational complexity; Continuous-time orbit problem; Linear algebra;
D O I：
10.1016/j.ipl.2014.08.004
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We place the continuous-time orbit problem in P, sharpening the decidability result shown by Hainry [7]. (c) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：11 / 14
页数：4
相关论文
共 50 条
  • [31] POLYNOMIAL-TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
    MIZUNO, S
    MASUZAWA, K
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1989, 32 (03) : 371 - 382
  • [32] POLYNOMIAL-TIME AGGREGATION OF INTEGER PROGRAMMING-PROBLEMS
    KANNAN, R
    JOURNAL OF THE ACM, 1983, 30 (01) : 133 - 145
  • [33] AN EXPLICIT SEPARATION OF RELATIVISED RANDOM POLYNOMIAL-TIME AND RELATIVISED DETERMINISTIC POLYNOMIAL-TIME
    ZIPPEL, R
    INFORMATION PROCESSING LETTERS, 1989, 33 (04) : 207 - 212
  • [34] On a Lyapunov equation for polynomial continuous-time systems
    Menini, Laura
    Tornambe, Antonio
    INTERNATIONAL JOURNAL OF CONTROL, 2014, 87 (02) : 393 - 403
  • [35] Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems
    Himmel, Anne-Sophie
    Mertzios, George B.
    Nichterlein, Andre
    Niedermeier, Rolf
    COMMUNICATIONS OF THE ACM, 2024, 67 (04) : 67 - 76
  • [36] Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
    Miyazawa, Flavio K.
    Pedrosa, Lehilton L. C.
    Schouery, Rafael C. S.
    Sviridenko, Maxim
    Wakabayashi, Yoshiko
    ALGORITHMICA, 2016, 76 (02) : 536 - 568
  • [37] Polynomial-time algorithms for multimarginal optimal transport problems with structure
    Altschuler, Jason M.
    Boix-Adsera, Enric
    MATHEMATICAL PROGRAMMING, 2023, 199 (1-2) : 1107 - 1178
  • [38] Polynomial-time algorithms for multimarginal optimal transport problems with structure
    Jason M. Altschuler
    Enric Boix-Adserà
    Mathematical Programming, 2023, 199 : 1107 - 1178
  • [39] Continuous-time identification of continuous-time systems
    Kowalczuk, Z
    Kozlowski, J
    (SYSID'97): SYSTEM IDENTIFICATION, VOLS 1-3, 1998, : 1293 - 1298
  • [40] Structure of Polynomial-Time Approximation
    van Leeuwen, Erik Jan
    van Leeuwen, Jan
    THEORY OF COMPUTING SYSTEMS, 2012, 50 (04) : 641 - 674
12345