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 条

[1] THE LOGIC-TERMAL EQUIVALENCE IS POLYNOMIAL-TIME DECIDABLE
SABELFELD, VK
INFORMATION PROCESSING LETTERS, 1980, 10 (02) : 57 - 62
[2] POLYNOMIAL-TIME ALGORITHM FOR THE ORBIT PROBLEM
KANNAN, R
LIPTON, RJ
JOURNAL OF THE ACM, 1986, 33 (04) : 808 - 821
[3] Polynomial-time word problems
Schleimer, Saul
COMMENTARII MATHEMATICI HELVETICI, 2008, 83 (04) : 741 - 765
[4] TREE EQUIVALENCE OF LINEAR RECURSIVE SCHEMATA IS POLYNOMIAL-TIME DECIDABLE
SABELFELD, VK
INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 147 - 153
[5] The property FDT is undecidable for finitely presented monoids that have polynomial-time decidable word problems
Otto, F
Sattler-Klein, A
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2000, 10 (03) : 285 - 307
[6] Pooling Problems with Polynomial-Time Algorithms
Dag Haugland
Eligius M. T. Hendrix
Journal of Optimization Theory and Applications, 2016, 170 : 591 - 615
[7] ON COUNTING PROBLEMS AND THE POLYNOMIAL-TIME HIERARCHY
ANGLUIN, D
THEORETICAL COMPUTER SCIENCE, 1980, 12 (02) : 161 - 173
[8] Optimization problems in the polynomial-time hierarchy
Umans, Christopher
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2006, 3959 : 345 - 355
[9] Pooling Problems with Polynomial-Time Algorithms
Haugland, Dag
Hendrix, Eligius M. T.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2016, 170 (02) : 591 - 615
[10] SINGLE-VALUEDNESS OF TREE-TRANSDUCERS IS DECIDABLE IN POLYNOMIAL-TIME
SEIDL, H
THEORETICAL COMPUTER SCIENCE, 1992, 106 (01) : 135 - 181

← 1 2 3 4 5 →