Continuous-time orbit problems are decidable in polynomial-time
- Publication Type:
- Journal Article
- Information Processing Letters, 2015, 115 (1), pp. 11 - 14
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
We place the continuous-time orbit problem in P, sharpening the decidability result shown by Hainry . © 2014 Published by Elsevier B.V.
Please use this identifier to cite or link to this item: