Proves that checking global identifiability of parametric linear ODE models over reals is NP-hard via equivalence to the injectivity problem.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Verifying global identifiability of parametric linear ODE models is NP-hard
Proves that checking global identifiability of parametric linear ODE models over reals is NP-hard via equivalence to the injectivity problem.