Continuous-time orbit problems are decidable in polynomial-time (Q458374)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Continuous-time orbit problems are decidable in polynomial-time |
scientific article; zbMATH DE number 6352031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Continuous-time orbit problems are decidable in polynomial-time |
scientific article; zbMATH DE number 6352031 |
Statements
Continuous-time orbit problems are decidable in polynomial-time (English)
0 references
7 October 2014
0 references
dynamical systems
0 references
differential equation
0 references
computational complexity
0 references
continuous-time orbit problem
0 references
linear algebra
0 references
