Continuous-time orbit problems are decidable in polynomial-time (Q458374): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972422534 / rank | |||
Normal rank | |||
Revision as of 23:16, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Continuous-time orbit problems are decidable in polynomial-time |
scientific article |
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
