Complexity of quantifier elimination in the theory of ordinary differential equations
From MaRDI portal
Publication:5393295
DOI10.1007/3-540-51517-8_81zbMath1209.68679OpenAlexW2119184073MaRDI QIDQ5393295
Publication date: 16 April 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-51517-8_81
Symbolic computation and algebraic computation (68W30) Differential algebra (12H05) Abstract differential equations (12H20) Software, source code, etc. for problems pertaining to ordinary differential equations (34-04)
Related Items (15)
Effective bounds for the consistency of differential equations ⋮ NC solving of a system of linear ordinary differential equations in several unknowns ⋮ Computability of the additive complexity of algebraic circuits with root extracting ⋮ Punctually presented structures I: Closure theorems ⋮ Effective uniform bounding in partial differential fields ⋮ New effective differential Nullstellensatz ⋮ Proof mining and effective bounds in differential polynomial rings ⋮ An upper bound for minimizing coefficients of the Kolchin dimension polynomial ⋮ An equivalence theorem for regular differential chains ⋮ Tropical Geometries and Dynamics of Biochemical Networks Application to Hybrid Cell Cycle Models ⋮ Complexity of solving parametric polynomial systems ⋮ A bound for orders in differential Nullstellensatz ⋮ Theory of computational complexity. Part 9. Transl. from the Russian. ⋮ On the complexity of the resolvent representation of some prime differential ideals ⋮ Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients
This page was built for publication: Complexity of quantifier elimination in the theory of ordinary differential equations
