Alexey Ovchinnikov
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1Systems and Control×1Algebraic Geometry×1Optimization and Control×1
Frequent co-authors
Research Timeline
2026
Verifying global identifiability of parametric linear ODE models is NP-hard
This paper determines that verifying global parameter identifiability for linear ODE models is an NP-hard problem, establishing a computational complexity boundary for the field.
Highlighted terms show continued research focus across papers