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 条
  • [21] CONTINUOUS-TIME CASINO PROBLEMS
    PESTIEN, VC
    SUDDERTH, WD
    MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (02) : 364 - 376
  • [22] Polynomial-time normalizers
    Luks, Eugene M.
    Miyazaki, Takunari
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2011, 13 (04): : 61 - 96
  • [23] DECIDABLE, POLYNOMIAL-TIME, AND NP-COMPLETE CASES OF THE ISOTONE BIPARTITE GRAPH PROBLEM
    TIMKOVSKII, VG
    KNYAZEVA, LV
    CYBERNETICS, 1990, 26 (04): : 581 - 591
  • [24] Periodic constraint satisfaction problems: Polynomial-time algorithms
    Chen, H
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS, 2003, 2833 : 199 - 213
  • [25] A polynomial-time algorithm for a class of protein threading problems
    Xu, Y
    Uberbacher, EC
    COMPUTER APPLICATIONS IN THE BIOSCIENCES, 1996, 12 (06): : 511 - 517
  • [26] POLYNOMIAL-TIME IMPLICATION PROBLEMS FOR UNARY INCLUSION DEPENDENCIES
    COSMADAKIS, SS
    KANELLAKIS, PC
    VARDI, MY
    JOURNAL OF THE ACM, 1990, 37 (01) : 15 - 46
  • [27] Strongly polynomial-time approximation for a class of bicriteria problems
    Levin, A
    OPERATIONS RESEARCH LETTERS, 2004, 32 (06) : 530 - 534
  • [28] Polynomial-Time Solvability of Dynamic Lot Size Problems
    Li, Chung-Lun
    Li, Qingying
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2016, 33 (03)
  • [29] Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
    Gate, James
    Stewart, Iain A.
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2010, 6072 : 120 - 131
  • [30] Polynomial-Time Approximation Schemes for Circle Packing Problems
    Miyazawa, Flavio K.
    Pedrosa, Lehilton L. C.
    Schouery, Rafael C. S.
    Sviridenko, Maxim
    Wakabayashi, Yoshiko
    ALGORITHMS - ESA 2014, 2014, 8737 : 713 - 724
12345