Bounds for Orders of Derivatives in Differential Elimination Algorithms

DOI10.1145/2930889.2930922zbMath1361.13015OpenAlexW2267787411MaRDI QIDQ2985833

G. A. Pogudin, Richard Gustavson, Alexey Ovchinnikov

Publication date: 10 May 2017

Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2930889.2930922

zbMATH Keywords

computational complexitypolynomial differential equationsdifferential elimination algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (2)

New order bounds in differential elimination algorithms ⋮ Proof mining and effective bounds in differential polynomial rings

This page was built for publication: Bounds for Orders of Derivatives in Differential Elimination Algorithms