Continuous-time orbit problems are decidable in polynomial-time

Publication Type:
Journal Article
Citation:
Information Processing Letters, 2015, 115 (1), pp. 11 - 14
Issue Date:
2015-01-01
Full metadata record
Files in This Item:
Filename Description Size
car.pdfPublished Version183.43 kB
Adobe PDF
We place the continuous-time orbit problem in P, sharpening the decidability result shown by Hainry [7]. © 2014 Published by Elsevier B.V.
Please use this identifier to cite or link to this item: